Automatically Refining Abstract Interpretations

DOI10.1007/978-3-540-78800-3_33zbMath1134.68356OpenAlexW2168496583MaRDI QIDQ5458344

Aditya V. Nori, Bhargav S. Gulavani, Supratik Chakraborty, Sriram K. Rajamani

Publication date: 11 April 2008

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78800-3_33

Mathematics Subject Classification ID

Theory of software (68N99)

Related Items (12)

Abstract interpretation as automated deduction ⋮ Improving the results of program analysis by abstract interpretation beyond the decreasing sequence ⋮ Sound Non-statistical Clustering of Static Analysis Alarms ⋮ Abstract Interpretation as Automated Deduction ⋮ Why does Astrée scale up? ⋮ Transformation-Enabled Precondition Inference ⋮ Combinatorial abstraction refinement for feasibility analysis of static priorities ⋮ Horn clause verification with convex polyhedral abstraction and tree automata-based refinement ⋮ Automatically Refining Abstract Interpretations ⋮ NIL: learning nonlinear interpolants ⋮ Refinement of Trace Abstraction ⋮ Refining abstract interpretations

Uses Software

• Apron
• SLAM
• ARMC
• Dagger

Cites Work

• Unnamed Item
• Abstractions from proofs
• Lazy abstraction
• Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
• Constraint Solving for Interpolation
• Automatically Refining Abstract Interpretations
• Static Analysis
• Lazy Abstraction with Interpolants
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Automatically Refining Abstract Interpretations