Reusing predicate precision in value analysis
From MaRDI portal
Publication:2165503
Recommendations
Cites work
- Abstraction-driven concolic testing
- Automatic construction of Hoare proofs from abstract interpretation results.
- Collaborative verification and testing with explicit assumptions
- Compositional may-must program analysis: unleashing the power of alternation
- Counterexample-guided abstraction refinement for symbolic model checking
- Empirical software metrics for benchmarking of verification tools
- From under-approximations to over-approximations and back
- scientific article; zbMATH DE number 1903378 (Why is no real title available?)
- Incremental Abstract Interpretation
- Incremental verification using trace abstraction
- Information reuse for multi-goal reachability analyses
- Lazy abstraction
- Lightweight bytecode verification
- Logic for Programming, Artificial Intelligence, and Reasoning
- MetaVal: witness validation via verification
- Modular demand-driven analysis of semantic difference for program versions
- Orion: High-Precision Methods for Static Error Analysis of C and C++ Programs
- Proof-carrying code from certified abstract interpretation and fixpoint compression
- Proof-Producing Program Analysis
- Structurally defined conditional data-flow static analysis
- Verification: Theory and Practice
This page was built for publication: Reusing predicate precision in value analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2165503)