DaCapo
From MaRDI portal
Software:19266
swMATH7215MaRDI QIDQ19266FDOQ19266
Author name not available (Why is that?)
Cited In (13)
- Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances
- Using abstract interpretation to add type checking for interfaces in Java bytecode verification
- Compact and efficient strings for Java
- Parametric Trace Slicing and Monitoring
- DEP+BURST: Online DVFS Performance Prediction for Energy-Efficient Managed Language Execution
- Specification-Based Program Repair Using SAT
- Accelerating program analyses in Datalog by merging library facts
- Selective context-sensitivity for \(k\)\textit{-CFA} with CFL-reachability
- Array bounds check elimination in the context of deoptimization
- Semantics and algorithms for parametric monitoring
- Faster algorithms for quantitative verification in bounded treewidth graphs
- The Complexity of Andersen’s Analysis in Practice
- Algorithms for algebraic path properties in concurrent systems of constant treewidth components
This page was built for software: DaCapo
