Reusing predicate precision in value analysis

DOI10.1007/978-3-031-07727-2_5zbMath1502.68079OpenAlexW4285258398MaRDI QIDQ2165503

Marie-Christine Jakobs

Publication date: 19 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07727-2_5

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Empirical software metrics for benchmarking of verification tools
• Proof-carrying code from certified abstract interpretation and fixpoint compression
• Lightweight bytecode verification
• MetaVal: witness validation via verification
• Structurally defined conditional data-flow static analysis
• Abstraction-driven Concolic Testing
• From Under-Approximations to Over-Approximations and Back
• Incremental Abstract Interpretation
• Counterexample-guided abstraction refinement for symbolic model checking
• Proof-Producing Program Analysis
• Orion: High-Precision Methods for Static Error Analysis of C and C++ Programs
• Collaborative Verification and Testing with Explicit Assumptions
• Lazy abstraction
• Modular Demand-Driven Analysis of Semantic Difference for Program Versions
• Compositional may-must program analysis
• Verification: Theory and Practice
• Information Reuse for Multi-goal Reachability Analyses
• Logic for Programming, Artificial Intelligence, and Reasoning
• Programming Languages and Systems
• Incremental verification using trace abstraction

This page was built for publication: Reusing predicate precision in value analysis