Automated verification of the Deutsch-Schorr-Waite tree-traversal algorithm

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

Volumn 4134 LNCS, Issue , 2006, Pages 261-279

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

^a University of Wisconsin   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ARTIFICIAL INTELLIGENCE; DATA REDUCTION; THEOREM PROVING; TREES (MATHEMATICS);

BINARY TREES; DEUTSCH-SCHORR-WAITE (DSW) ALGORITHM; POINTER MANIPULATION;

ALGORITHMS;

EID: 33749859248     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11823230_17     Document Type: Conference Paper

References (23)

1. R. Bornat. Proofs of pointer programs in Jape. "Available at http://www.dcs.qmul.ac.uk/~richard/pointers/".
2. R. Bornat. Proving pointer programs in Hoare logic. In Mathematics of Program Construction, pages 102-126, July 2000.
3. R. Bornat and B. Sufrin. Animating formal proofs at the surface: The Jape proof calculator. The Computer Journal, 43:177-192, 1999.
4. L. Hendren. Parallelizing Programs with Recursive Data Structures. PhD thesis, Dept. of Computer Science, Cornell University, January 1990.
5. S. Ishtiaq and P. O'Hearn, Bi as an assertion language for mutable data structures, In Symp. on Principles of Programming Languages, pages 14-26, January 2001.
6. D. Knuth. The Art of Computer Programming-Vol. 1, Fundamental Algorithms. Addison-Wesley, 1973.
7. 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.
8. T. Lev-Ami, N. Immerman, and M. Sagiv. Fast and precise abstraction for shape analysis. To appear in Proc. Computer-Aided Verification, August 2006.
9. T. Lev-Ami, T. Reps, M. Sagiv, and R. Wilhelm. Putting static analysis to work for verification: A case study. In Int. Symp. on Software Testing and Analysis, pages 26-38, August 2000.
10. G. Lindstrom. Scanning list structures without stacks or tag bits. Information Processing Letters, 2(2):41-51, June 1973.
11. A. Loginov, T. Reps, and M. Sagiv. Abstraction refinement via inductive learning. In Proc. Computer-Aided Verification, pages 519-533, July 2005.
12. R. Manevich, M. Sagiv, G. Ramalingam, and J. Field, Partially disjunctive heap abstraction. In Static Analysis Symp., pages 265-279, August 2004.
13. F. Mehta and T. Nipkow. Proving pointer programs in higher-order logic. In Automated Deduction - CADE-19, pages 121-135, July 2003.
14. J. Morris. Verification-oriented language design. Tech. Report TR-7, Computer Science Div., University of California-Berkeley, December 1972.
15. T. Reps, M. Sagiv, and A. Loginov. Finite differencing of logical formulas with applications to program analysis. In European Symp. On Programming, pages 380-398, April 2003.
16. J. Reynolds. Separation Logic: A logic for shared mutable data structures. In Symp. on Logic in Computer Science, pages 55-74, July 2002.
17. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic, ACM Trans, on Programming Languages and Systems (TOPLAS), 24(3):217-298, 2002.
18. H. Schorr and W. Waite. An efficient machine independent procedure for garbage collection in various list structures. Communications of the ACM, 10(8):501-506, August 1967.
19. N. Suzuki. Automatic Verification of Programs with Complex Data Structures. PhD thesis, Dept. of Computer Science, Stanford University, February 1976.
20. R. Topor. The correctness of the Schorr-Waite list marking algorithm. Tech. Report MIP-R-104, School of Artificial Intelligence, University of Edinburgh, July 1974.
21. H.Yang. Local Reasoning for Stateful Programs. PhD thesis, Dept. of Computer Science, University of Illinois, Urbana-Champaign, June 2001.
22. L. Yelowitz and A. Duncan, Abstractions, instantiations, and proofs of marking algorithms, In Symp. on Artificial Intelligence and Programming Languages, pages 13-21, August 1977.
23. G. Yorsh, T. Reps, M. Sagiv, and R. Wilhelm. Logical characterizations of heap abstractions. To appear in ACM Transactions on Computational Logic (TOCL).