Automatically Refining Abstract Interpretations

DOI10.1007/978-3-540-78800-3_33MaRDI QIDQ5458344zbMATH OpenOpenAlexFDO

Authors Bhargav S. Gulavani, Supratik Chakraborty, Aditya V. Nori, 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)

Recommendations

• Refining abstract interpretations
• Tools and Algorithms for the Construction and Analysis of Systems
• Fixpoint-Guided Abstraction Refinements
• Refinement of Trace Abstraction
• Widening with Thresholds for Programs with Complex Control Graphs

Cites work

• scientific article; zbMATH DE number 2090855 (Why is no real title available?)
• Abstractions from proofs
• Automatically Refining Abstract Interpretations
• Constraint Solving for Interpolation
• Lazy Abstraction with Interpolants
• Lazy abstraction
• Static Analysis
• 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
• Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
• Verification, Model Checking, and Abstract Interpretation

Cited in

(15)

• Sound non-statistical clustering of static analysis alarms
• Tools and Algorithms for the Construction and Analysis of Systems
• Combinatorial abstraction refinement for feasibility analysis of static priorities
• Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
• NIL: learning nonlinear interpolants
• Transformation-Enabled Precondition Inference
• Refinement of Trace Abstraction
• Abstract Interpretation as Automated Deduction
• Refining abstract interpretations
• Why does Astrée scale up?
• Verifying numerical programs via iterative abstract testing
• Abstract interpretation as automated deduction
• Automatically Refining Abstract Interpretations
• Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
• Refinement by Interpretation in a General Setting

Describes a project that uses

Uses Software

• Dagger
• ARMC
• SLAM
• Apron

This page was built for publication: Automatically Refining Abstract Interpretations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458344)