An inference-rule-based decision procedure for verification of heap-manipulating programs with mutable data and cyclic data structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4349 LNCS, Issue , 2007, Pages 106-121

  Rakamarić, Zvonimir ^a   Bingham, Jesse ^b   Hu, Alan J ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER OPERATING SYSTEMS; DATA STRUCTURES; FORMAL LOGIC; VERIFICATION;

AUTOMATIC VERIFICATION; CONTAINER FUNCTIONS; CYCLIC STRUCTURES; LINUX KERNEL;

DECISION THEORY;

EID: 36349035026     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69738-1_8     Document Type: Conference Paper

References (38)

1. J. Bingham and Z. Rakamarić. A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs. In Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI), 2006.
2. J. Bingham and Z. Rakamarić. A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs, 2005. UBC Dept. Comp. Sci. Tech Report TR-2005-19, http://www.cs.ubc.ca/cgi-bin/tr/2005/TR-2005-19.
3. Z. Rakamarić, J. Bingham, and A. J. Hu. A Better Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs, 2006. UBC Dept. Comp. Sci. Tech Report TR-2006-02, http://www.cs.ubc.ca/cgi-bin/ tr/2006/TR-2006-02.
4. A. Gotsman, J. Berdine, and B. Cook. Interprocedural Shape Analysis with Separated Heap Abstractions. In Static Analysis Symposium (SAS), 2006.
5. J. Berdine, C. Calcagno, and P. W O'Hearn. A Decidable Fragment of Separation Logic. In Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2004.
6. J. Berdine, C. Calcagno, and P. W. O'Hearn. Smallfoot: Modular Automatic Assertion Checking with Separation Logic. In Intl. Symp. on Formal Methods for Components and Objects (FMCO), 2006.
7. I. Balaban, A. Pnueli, and L. Zuck. Shape Analysis by Predicate Abstraction. In Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI), 2005.
8. C. Flanagan and S. Qadeer. Predicate Abstraction for Software Verification. In Symp. on Principles of Programming Languages (POPL), 2002.
9. G. Nelson. Techniques for Program Verification. PhD thesis, Stanford University, 1979.
10. G. Nelson. Verifying Reachability Invariants of Linked Structures. In Symp. on Principles of Programming Languages (POPL), 1983.
11. M. Benedikt, T. Reps, and M. Sagiv. A Decidable Logic for Describing Linked Data Structures. In European Symposium on Programming (ESOP), 1999.
12. N. Immerman, A. Rabinovich, T Reps, M. Sagiv, and G. Yorsh. The Boundary Between Decidability and Undecidability for Transitive Closure Logics. In Workshop on Computer Science Logic (CSL), 2004.
13. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Symp. on Principles of Programming Languages (POPL), 1977.
14. D. Dams and K. S. Namjoshi. Shape Analysis Through Predicate Abstraction and Model Checking. In Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI), 2003.
15. S. Graf and H. Saidi. Construction of Abstract State Graphs with PVS. In Conf. on Computer Aided Verification (CAV), 1997.
16. S. Das, D. L. Dill, and S. Park. Experience with Predicate Abstraction. In Conf. on Computer Aided Verification (CAV), 1999.
17. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy Abstraction. In Symp. on Principles of Programming Languages (POPL), 2002.
18. A. Møller and M. I. Schwartzbach. The Pointer Assertion Logic Engine. In Conf. on Programming Language Design and Implementation (PLDI), 2001.
19. T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard. Field Constraint Analysis. In Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI), 2006.
20. T. Reps, M. Sagiv, and A. Loginov. Finite Differencing of Logical Formulas for Static Analysis. In European Symposium on Programming (ESOP), 2003.
21. G. Yorsh, A. Rabinovich, M. Sagiv, A. Meyer, and A. Bouajjani. A Logic of Reachable Patterns in Linked Data-Structures. In Foundations of Software Science and Computation Structures (FOSSACS), 2006.
22. N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh. Verification via Structure Simulation. In Conf. on Computer Aided Verification (CAV), 2004.
23. S. K. Lahiri and S. Qadeer. Verifying Properties of Well-Founded Linked Lists. In Symp. on Principles of Programming Languages (POPL), 2006.
24. R. Manevich, E. Yahav, G. Ramalingam, and M. Sagiv. Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. In Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI), 2005.
25. A. Loginov, T. W. Reps, and S. Sagiv. Abstraction Refinement via Inductive Learning. In Conf. on Computer Aided Verification (CAV), 2005.
26. D. Distefano, P W. O'Hearn, and H. Yang. A Local Shape Analysis Based on Separation Logic. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2006.
27. S. Ishtiaq and P. W. O'Hearn. BI as an Assertion Language for Mutable Data Structures. In Symp. on Principles of Programming Languages (POPL), 2001.
28. S. Magill, A. Nanevski, E. M. Clarke, and P. Lee. Inferring Invariants in Separation Logic for Imperative List-processing Programs. In Workshop on Semantics, Program Analysis, and Computing Environments for Memory Management (SPACE), 2006.
29. T. Lev-Ami, N. Immerman, and M. Sagiv. Abstraction for Shape Analysis with Fast and , Precise Transformers. In Conf. on Computer Aided Verification (CAV), 2006.
30. N. Klarlund, A. Møller, and M. I. Schwartzbach. MONA Implementation Secrets. In Conf. on Implementation and Application of Automata (CIAA), 2000.
31. T. Lev-Ami and M. Sagiv. TVLA: A System for Implementing Static Analyses. In Static Analysis Symposium (SAS), 2000.
32. T. Ball, R. Majumdar, T. D. Millstein, and S. K. Rajamani. Automatic Predicate Abstraction of C Programs. In Conf. on Programming Language Design and Implementation (PLDI), 2001.
33. G. Yorsh, T. Reps, and M. Sagiv. Symbolically Computing Most-Precise Abstract Operations for Shape Analysis. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2004.
34. S. Ranise and C. G. Zarba. A Theory of Singly-Linked Lists and its Extensible Decision Procedure. In IEEE Int. Conf on Software Engineering and Formal Methods (SEFM), 2006.
35. K. L. McMillan. Applications of Craig Interpolants in Model Checking. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2005.
36. C. A. R. Hoare. An Axiomatic Basis for Computer Programming. Communications of the ACM, 12(10):576-583, 1969.
37. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems (TOPLAS), 8(2):244-263, 1986.
38. T. Lev-Ami, N. Immerman, T. W. Reps, M. Sagiv, S. Srivastava, and G. Yorsh. Simulating Reachability using First-Order Logic with Applications to Verification of Linked Data Structures. In Conf. on Automated Deduction (CADE), 2005.