Lifting abstract interpreters to quantified logical domains

ACM SIGPLAN Notices

Volumn 43, Issue 1, 2008, Pages 235-246

  Gulwani, Sumit ^a   McCloskey, Bill ^b   Tiwari, Ashish ^c  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c SRI INTERNATIONAL   (United States)

Author keywords

Abstract Interpreter; Logical Lattices; Quantified Invariants; Underapproximation Algorithms

Indexed keywords

COMPUTER PROGRAMMING;

ABSTRACT DOMAINS; APPROXIMATION OPERATIONS; AUTOMATIC TECHNIQUE; QUANTIFIED INVARIANTS; SORTING ALGORITHM; UNDER-APPROXIMATION; VARIABLE ELIMINATION;

COMPUTER SCIENCE;

EID: 67650149829     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1328897.1328468     Document Type: Article

References (16)

1. Dirk Beyer, Tom Henzinger, Rupak Majumdar, and Andrey Rybalchenko. Path invariants. In PLDI, 2007.
2. Jesse D. Bingham and Zvonimir Rakamaric. A logic and decision procedure for predicate abstraction of heap-manipulating programs. In VMCAI, pages 207-221, 2006.
3. A. R. Bradley, Z. Manna, and H. Sipma. What's decidable about arrays? In VMCAI, volume 3855 of LNCS, pages 427-442. Springer, 2006.
4. P. Cerny. Verification par interpretation abstraite de predicats parametriques. Master's thesis, Univ. Paris VII & Ecole normale su-perieure, Paris 20, 2003.
5. Patrick Cousot. Verification by abstract interpretation. In Verification: Theory and Practice, volume 2772 of LNCS, pages 243-268, 2003.
6. Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, pages 234-252, 1977.
7. Patrick Cousot and Nicolas Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL, pages 84-97, 1978.
8. Cormac Flanagan and Shaz Qadeer. Predicate abstraction for software verification. In POPL, pages 191-202, 2002.
9. Denis Gopan, Thomas W. Reps, and Shmuel Sagiv. A framework for numeric analysis of array operations. In POPL, pages 338-350, 2005.
10. Sumit Gulwani and Ashish Tiwari. Combining abstract interpreters. In PLDI, pages 376-386, June 2006.
11. Sumit Gulwani and Ashish Tiwari. Static analysis of heap manipulating low-level software. In CAV, LNCS, 2007.
12. Sumit Gulwani, Bill McCloskey, and Ashish Tiwari. Lifting abstract interpreters to quantified logical domains. Technical Report MSR-TR-2007-87, Microsoft Research, July 2007.
13. Ranjit Jhala and Ken McMillan. Array abstractions from proofs. In CAV, 2007.
14. Michael Karr. Affine relationships among variables of a program. In Acta Informatica, pages 133-151. Springer, 1976.
15. Shuvendu K. Lahiri and Randal E. Bryant. Indexed predicate discovery for unbounded system verification. In CAV, pages 135-147, 2004.
16. Matthew Might. Logic-flow analysis of higher-order programs. In POPL, pages 185-198, 2007.