Refining abstract interpretations

Authors:
Bhargav S. Gulavani;Supratik Chakraborty;Aditya V. Nori;Sriram K. Rajamani
Affiliations:
IIT Bombay, India;IIT Bombay, India;Microsoft Research Bangalore, India;Microsoft Research Bangalore, India
Venue:
Information Processing Letters
Year:
2010

Citing 8
Cited 2

The SLAM project: debugging system software via static analysis

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lazy abstraction

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automatic Generation of Invariants and Assertions

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Abstractions from proofs

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatically refining abstract interpretations

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
ARMC: the logical choice for software model checking with abstraction refinement

PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
Counterexample driven refinement for abstract interpretation

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

TRACER: a symbolic execution tool for verification

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Loop summarization using state and transition invariants

Formal Methods in System Design

Quantified Score

Hi-index	0.89

Visualization

Abstract

Abstract interpretation techniques prove properties of programs by computing abstract fixpoints. All such analyses suffer from the possibility of false errors. We present a dag-based abstraction refinement technique to automatically refine such abstract interpretations and reduce false errors. This technique refines precision loss due to widen operator by a new interpolated widen operator and refines precision loss due to join operator by disjunctions. We prove the soundness and progress properties of this abstraction refinement procedure.