Program verification using templates over predicate abstraction

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2009, Pages 223-234

  Srivastava, Saurabh ^a   Gulwani, Sumit ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Constraint based fixed point; Iterative fixed point; Predicate abstraction; Quantified invariants; SMT solvers; Template invariants; Weakest preconditions

Indexed keywords

BOOLEAN STRUCTURE; CONSTRAINT-BASED; CORRECTNESS PROOFS; FIXED POINTS; ITERATIVE APPROACH; NOVEL ALGORITHM; OPTIMAL SOLUTIONS; PREDICATE ABSTRACTIONS; PROGRAM INVARIANTS; PROGRAM PROPERTIES; PROGRAM VERIFICATION; SORTING ALGORITHM; UPPER BOUND; WEAKEST PRECONDITION;

ABSTRACTING; C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; LINGUISTICS; PROBLEM ORIENTED LANGUAGES;

ALGORITHMS;

EID: 70450231636     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542476.1542501     Document Type: Conference Paper

References (32)

1. Dirk Beyer, Thomas Henzinger, Rupak Majumdar, and Andrey Rybalchenko. Invariant synthesis for combined theories. In VMCAI, volume 4349 of LNCS, pages 378-394, 2007.
2. Dirk Beyer, Tom Henzinger, Rupak Majumdar, and Andrey Rybalchenko. Path invariants. In PLDI, pages 300-309, 2007.
3. Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement. In CAV, pages 154-169, 2000.
4. Michael Colón, Sriram Sankaranarayanan, and Henny Sipma. Linear invariant generation using non-linear constraint solving. In CAV, pages 420-432, 2003.
5. 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 238-252, 1977.
6. Leonardo de Moura and Nikolaj Bjørner. Efficient E-matching for smt solvers. In CADE, pages 183-198, 2007.
7. Leonardo de Moura and Nikolaj Bjørner. Z3: Efficient SMT solver. In TACAS, volume 4963 of LNCS, pages 337-340, April 2008.
8. Jr. Edmund M. Clarke, Orna Grumberg, and Doron A. Peled. Model checking. MIT Press, Cambridge, MA, USA, 1999.
9. Cormac Flanagan and Shaz Qadeer. Predicate abstraction for software verification. In POPL, pages 191-202, 2002.
10. Susanne Graf and Hassen Saïdi. Construction of abstract state graphs with PVS. In Computer Aided Verification, pages 72-83, 1997.
11. Sumit Gulwani, Sagar Jain, and Eric Koskinen. Control-flow refinement and progress invariants for bound analysis. In PLDI, 2009.
12. Sumit Gulwani, Bill McCloskey, and Ashish Tiwari. Lifting abstract interpreters to quantified logical domains. In POPL, pages 235-246, 2008.
13. Sumit Gulwani, Saurabh Srivastava, and Ramarathnam Venkatesan. Program analysis as constraint solving. In PLDI, pages 281-292, 2008.
14. Sumit Gulwani, Saurabh Srivastava, and Ramarathnam Venkatesan. Constraint-based invariant inference over predicate abstraction. In VMCAI, pages 120-135, 2009.
15. Nicolas Halbwachs and Mathias Péron. Discovering properties about arrays in simple programs. In PLDI, pages 339-348, 2008.
16. Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Kenneth L. McMillan. Abstractions from proofs. In POPL, pages 232-244, 2004.
17. Ranjit Jhala and Ken McMillan. Array abstraction from proofs. In CAV, 2007.
18. Deepak Kapur. Automatically generating loop invariants using quantifier elimination. In, 2005.
19. Gary A. Kildall. A unified approach to global program optimization. In POPL, pages 194-206, 1973.
20. Laura Kovács and Andrei Voronkov. Finding loop invariants for programs over arrays using a theorem prover. In FASE, 2009.
21. Shuvendu K. Lahiri and Randal E. Bryant. Predicate abstraction with indexed predicates. ACM Trans. on Computational Logic, 9(1), 2007.
22. Andreas Podelski and Thomas Wies. Boolean heaps. In SAS, 2005.
23. Thomas W. Reps, Shmuel Sagiv, and Greta Yorsh. Symbolic impl. of the best transformer. In VMCAI, pages 252-266, 2004.
24. Microsoft Research. Phoenix. http://research.microsoft.com/Phoenix/.
25. Microsoft Research. Z3. http://research.microsoft.com/projects/Z3/.
26. Sriram Sankaranarayanan, Henny Sipma, and Zohar Manna. Nonlinear loop invariant generation using gröbner bases. In POPL, pages 318-329, 2004.
27. Sriram Sankaranarayanan, Henny B. Sipma, and Zohar Manna. Constraint-based linear-relations analysis. In SAS, pages 53-68, 2004.
28. Armando Solar-Lezama, Gilad Arnold, Liviu Tancau, Rastislav Bodik, Vijay Saraswat, and Sanjit A. Seshia. Sketching stencils. In PLDI, pages 167-178, June 2007.
29. Armando Solar-Lezama, Liviu Tancau, Rastislav Bodik, Vijay Saraswat, and Sanjit A. Seshia. Combinatorial sketching for finite programs. In ASPLOS, pages 404-415, Oct 2006.
30. Saurabh Srivastava and Sumit Gulwani. Program verification using templates over predicate abstraction. Technical Report MSR-TR-2008-173, Nov 2008.
31. 3: SMT-solvers for program verification. In CAV, 2009.
32. Karen Zee, Viktor Kuncak, and Martin C. Rinard. Full functional verification of linked data structures. In PLDI, pages 349-361, 2008.