Refinement-based verification for possibly-cyclic lists

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

Volumn 4444 LNCS, Issue , 2007, Pages 247-272

  Loginov, Alexey ^a   Reps, Thomas ^b   Sagiv, Mooly ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b University of Wisconsin

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; FINITE DIFFERENCE METHOD; VERIFICATION;

ABSTRACTION REFINEMENT MECHANISM; AUTOMATIC VERIFICATION; LIST-REVERSAL ALGORITHM; REACHABILITY INFORMATION;

ABSTRACTING;

EID: 39149084710     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71322-7_12     Document Type: Conference Paper

References (18)

1. D Distefano, P O'Hearn, and H Yang. Interprocedural shape analysis with separated heap abstractions. In Tools and Algs. for the Construction and Analysis of Systems, pages 287-302, March 2006.
2. G. Dong and J. Su. Incremental maintenance of recursive views using relational calculus/SQL. SIGMOD Record, 29(1):44-51, 2000.
3. A. Gotsman, J. Berdine, and B. Cook. Interprocedural shape analysis with separated heap abstractions. In Static Analysis Symp., pages 240-260, August 2006.
4. W. Hesse. Dynamic Computational Complexity. PhD thesis, Dept. of Computer Science, University of Massachusetts, June 2003.
5. 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, pages 160-174, September 2004.
6. N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh. Verification via structure simulation. In Computer-Aided Verification, pages 281-294, July 2004.
7. N. Klarlund and M. Schwartzbach. Graph types. In Symp. on Principles of Programming Languages, January 1993.
8. S. Lahiri and S. Qadeer. Verifying properties of well-founded linked lists. In Symp. on Principles of Programming Languages, pages 115-126, January 2006.
9. O. Lee, H. Yang, and K. Yi. Automatic verification of pointer programs using grammar-based shape analysis. In European Symp. On Programming, pages 124-140, April 2005.
10. A. Loginov, T. Reps, and M. Sagiv. Abstraction refinement via inductive learning. In Computer-Aided Verification, pages 519-533, July 2005.
11. R. Manevich, E. Yahav, G. Ramalingam, and M. Sagiv. Predicate abstraction and canonical abstraction for singly-linked lists. In Verification, Model Checking, and Abstract Interpretation, pages 181-198, January 2005.
12. A. Møller and M. Schwartzbach. The pointer assertion logic engine. In Conf. on Programming Language Design and Impl., pages 221-231, June 2001.
13. G. Nelson. Verifying reachability invariants of linked structures. In Symp. on Principles of Programming Languages, pages 38-47, January 1983.
14. T. Reps, M. Sagiv, and A. Loginov. Finite differencing of logical formulas for static analysis. In European Symp. On Programming, pages 380-398, April 2003.
15. J. Reynolds. Separation Logic: A logic for shared mutable data structures. In Symp. on Logic in Computer Science, pages 55-74, July 2002.
16. N. Rinetzky, J. Bauer, T. Reps, M. Sagiv, and R. Wilhelm. A semantics for procedure local heaps and its abstractions. In Symp. on Principles of Programming Languages, pages 296-309, January 2005.
17. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. Trans. on Programming Languages and Systems (TOPLAS), 24(3):217-298, 2002.
18. G. Yorsh, T. Reps, M. Sagiv, and R. Wilhelm. Logical characterizations of heap abstractions. To appear in ACM Transactions on Computational Logic (TOCL).