The following pages link to DaCapo (Q19266):
Displaying 13 items.
- Using abstract interpretation to add type checking for interfaces in Java bytecode verification (Q974112) (← links)
- Compact and efficient strings for Java (Q988196) (← links)
- Array bounds check elimination in the context of deoptimization (Q1016641) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- Accelerating program analyses in Datalog by merging library facts (Q2145320) (← links)
- Selective context-sensitivity for \(k\)\textit{-CFA} with CFL-reachability (Q2145335) (← links)
- Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Q2828317) (← links)
- Semantics and Algorithms for Parametric Monitoring (Q2881076) (← links)
- Specification-Based Program Repair Using SAT (Q3000646) (← links)
- The Complexity of Andersen’s Analysis in Practice (Q3392927) (← links)
- Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances (Q3453234) (← links)
- Parametric Trace Slicing and Monitoring (Q3617763) (← links)
- DEP+BURST: Online DVFS Performance Prediction for Energy-Efficient Managed Language Execution (Q5280456) (← links)
