Recursive proofs for inductive tree data-structures

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2012, Pages 123-135

  Madhusudan, P ^a   Qiu, Xiaokang ^a   Stefanescu, Andrei ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Heap analysis; Recursive program; SMT solver; Tree

Indexed keywords

AVL TREE; B TREES; FIRST ORDER LOGIC; FUNCTIONAL PROPERTIES; FUNCTIONAL SPECIFICATION; HEAP ANALYSIS; IMPERATIVE PROGRAMS; RECURSIONS; RECURSIVE DEFINITIONS; RECURSIVE PROGRAMS; RED BLACK TREE; SYSTEMATIC METHODOLOGY; TREE;

ALGORITHMS; COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES;

TREES (MATHEMATICS);

EID: 84857805008     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2103656.2103673     Document Type: Conference Paper

References (27)

1. I. Balaban, A. Pnueli, and L. D. Zuck. Shape analysis by predicate abstraction. In VMCAI'05, volume 3385 of LNCS, pages 164-180. Springer, 2005. (Pubitemid 41231360)
2. M. Barnett, B.-Y. E. Chang, R. DeLine, B. Jacobs, and K. R.M. Leino. Boogie: A modular reusable verifier for object-oriented programs. In FMCO'05, volume 4111 of LNCS, pages 364-387. Springer, 2005. (Pubitemid 44548955)
3. J. Berdine, C. Calcagno, and P. W. O'Hearn. A decidable fragment of separation logic. In FSTTCS'04, volume 3328 of LNCS, pages 97-109. Springer, 2004. (Pubitemid 39740216)
4. J. Berdine, C. Calcagno, and P.W. O'Hearn. Symbolic execution with separation logic. In APLAS'05, volume 3780 of LNCS, pages 52-68. Springer, 2005.
5. N. Bjørner and J. Hendrix. Linear functional fixed-points. In CAV'09, volume 5643 of LNCS, pages 124-139. Springer, 2009.
6. A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu. A logicbased framework for reasoning about composite data structures. In CONCUR'09, volume 5710 of LNCS, pages 178-195. Springer, 2009.
7. A. R. Bradley and Z. Manna. The Calculus of Computation. Springer, 2007.
8. W.-N. Chin, C. David, H. H. Nguyen, and S. Qin. Automated verification of shape, size and bag properties via user-defined predicates in separation logic. Science of Computer Programming, in press, 2010.
9. A. Chlipala. Mostly-automated verification of low-level programs in computational separation logic. In PLDI'11, pages 234-245. ACM, 2011.
10. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, third edition, 2009.
11. L. M. de Moura and N. Bjørner. Z3: An efficient SMT solver. In TACAS'08, volume 4963 of LNCS, pages 337-340. Springer, 2008.
12. INRIA. The coq proof assistant. URL http://coq.inria.fr/.
13. V. Kuncak, R. Piskac, and P. Suter. Ordered sets in the calculus of data structures. In CSL'10, volume 6247 of LNCS, pages 34-48. Springer, 2010.
14. S. Lahiri and S. Qadeer. Back to the future: revisiting precise program verification using SMT solvers. In POPL'08, pages 171-182. ACM, 2008.
15. P. Madhusudan and X. Qiu. Efficient decision procedures for heaps using STRAND. In SAS'11, volume 6887 of LNCS, pages 43-59. Springer, 2011.
16. P. Madhusudan, G. Parlato, and X. Qiu. Decidable logics combining heap structures and data. In POPL'11, pages 611-622. ACM, 2011.
17. S. Magill, M.-H. Tsai, P. Lee, and Y.-K. Tsay. THOR: A tool for reasoning about shape and arithmetic. In CAV'08, volume 5123 of LNCS, pages 428-432. Springer, 2008.
18. G. Nelson. Verifying reachability invariants of linked structures. In POPL'83, pages 38-47. ACM, 1983. (Pubitemid 14477105)
19. P. W. O'Hearn, J. C. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In CSL'01, volume 2142 of LNCS, pages 1-19. Springer, 2001. (Pubitemid 33332625)
20. Z. Rakamarić, J. D. Bingham, and A. J. Hu. An inference-rule-based decision procedure for verification of heap-manipulating programs with mutable data and cyclic data structures. In VMCAI'07, volume 4349 of LNCS, pages 106-121. Springer, 2007. (Pubitemid 350143488)
21. Z. Rakamarić, R. Bruttomesso, A. J. Hu, and A. Cimatti. Verifying heap-manipulating programs in an SMT framework. In ATVA'07, volume 4762 of LNCS, pages 237-252. Springer, 2007.
22. S. Ranise and C. Zarba. A theory of singly-linked lists and its extensible decision procedure. In SEFM'06, pages 206-215. IEEE-CS, 2006.
23. J. Reynolds. Separation logic: a logic for shared mutable data structures. In LICS'02, pages 55-74. IEEE-CS, 2002.
24. G. Rosu, C. Ellison, and W. Schulte. Matching logic: An alternative to Hoare/Floyd logic. In AMAST'10, volume 6486 of LNCS, pages 142-162. Springer, 2010.
25. P. Suter, M. Dotta, and V. Kuncak. Decision procedures for algebraic data types with abstractions. In POPL'10, pages 199-210. ACM, 2010.
26. K. Zee, V. Kuncak, and M. C. Rinard. Full functional verification of linked data structures. In PLDI'08, pages 349-361. ACM, 2008.
27. K. Zee, V. Kuncak, and M. C. Rinard. An integrated proof language for imperative programs. In PLDI'09, pages 338-351. ACM, 2009.