Natural proofs for structure, data, and separation

ACM SIGPLAN Notices

Volumn 48, Issue 6, 2013, Pages 231-242

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

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

Author keywords

Data structures; Heap analysis; Natural proofs; Separation logic; SMT solvers

Indexed keywords

DEDUCTIVE VERIFICATION; FUNCTIONAL CORRECTNESS; FUNCTIONAL VERIFICATION; HEAP ANALYSIS; NATURAL PROOFS; SCHORR-WAITE ALGORITHM; SEPARATION LOGIC; SMT SOLVERS;

C (PROGRAMMING LANGUAGE); DATA STRUCTURES;

FORMAL LOGIC;

EID: 84880106211     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2499370.2462169     Document Type: Conference Paper

References (44)

1. I. Balaban, A. Pnueli, and L. D. Zuck. Shape analysis of single-parent heaps. In VMCAI'07, volume 4349 of LNCS, pages 91-105. Springer, 2007.
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.
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.
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. J. Berdine, C. Calcagno, and P. W. O'Hearn. Smallfoot: Modular automatic assertion checking with separation logic. In FMCO'05, volume 4111 of LNCS, pages 115-137. Springer, 2005.
6. J. Berdine, C. Calcagno, B. Cook, D. Distefano, P. W. O'Hearn, T. Wies, and H. Yang. Shape analysis for composite data structures. In CAV'07, volume 4590 of LNCS, pages 178-192. Springer, 2007.
7. N. Bjørner and J. Hendrix. Linear functional fixed-points. In CAV'09, volume 5643 of LNCS, pages 124-139. Springer, 2009.
8. M. Botinčan, M. Parkinson, and W. Schulte. Separation logic verification of C programs with an SMT solver. ENTCS, 254:5 - 23, 2009.
9. A. Bouajjani, C. Dřagoi, 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.
10. A. Bouajjani, C. Dřagoi, C. Enea, and M. Sighireanu. On interprocedural analysis of programs with lists and data. In PLDI'11, pages 578-589. ACM, 2011.
11. M. Bozga, R. Iosif, and S. Perarnau. Quantitative separation logic and programs with lists. In IJCAR'08, volume 5195 of LNCS, pages 34-49. Springer, 2008.
12. A. R. Bradley, Z.Manna, and H. B. Sipma. What's decidable about arrays? In VMCAI'06, volume 3855 of LNCS, pages 427-442. Springer, 2006.
13. B.-Y. E. Chang and X. Rival. Relational inductive shape analysis. In POPL'08, pages 247-260. ACM, 2008.
14. 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, 77(9):1006 -1036, 2012.
15. A. Chlipala. Mostly-automated verification of low-level programs in computational separation logic. In PLDI'11, pages 234-245. ACM, 2011.
16. E. Cohen,M. Dahlweid, M. A. Hillebrand, D. Leinenbach, M.Moskal, T. Santen, W. Schulte, and S. Tobies. VCC: A practical system for verifying concurrent C. In TPHOLs'09, volume 5674 of LNCS, pages 23-42. Springer, 2009.
17. 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.
18. D. Distefano, P. W. O'Hearn, and H. Yang. A local shape analysis based on separation logic. In TACAS'06, volume 3920 of LNCS, pages 287-302. Springer, 2006.
19. T. Hubert and C. Marché. A case study of C source code verification: the Schorr-Waite algorithm. In SEFM'05, pages 190-199. IEEE-CS, 2005.
20. B. Jacobs, J. Smans, P. Philippaerts, F. Vogels, W. Penninckx, and F. Piessens. Verifast: A powerful, sound, predictable, fast verifier for C and Java. In NFM'11, volume 6617 of LNCS, pages 41-55. Springer, 2011.
21. N. Klarlund and A. Møller. MONA. BRICS, Department of Computer Science, Aarhus University, January 2001. Available from http://www.brics.dk/ mona/.
22. S. Lahiri and S. Qadeer. Back to the future: revisiting precise program verification using SMT solvers. In POPL'08, pages 171-182. ACM, 2008.
23. K. R. M. Leino. Dafny: An automatic program verifier for functional correctness. In LPAR-16, volume 6355 of LNCS, pages 348-370. Springer, 2010.
24. A. Loginov, T. W. Reps, and M. Sagiv. Automated verification of the Deutsch-Schorr-Waite tree-traversal algorithm. In SAS'06, volume 4134 of LNCS, pages 261-279. Springer, 2006.
25. P. Madhusudan and X. Qiu. Efficient decision procedures for heaps using STRAND. In SAS'11, volume 6887 of LNCS, pages 43-59. Springer, 2011.
26. P. Madhusudan, G. Parlato, and X. Qiu. Decidable logics combining heap structures and data. In POPL'11, pages 611-622. ACM, 2011.
27. P. Madhusudan, X. Qiu, and A. Stefanescu. Recursive proofs for inductive tree data-structures. In POPL'12, pages 123-136. ACM, 2012.
28. 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.
29. H. Mai, E. Pek, H. Xue, S. T. King, and P. Madhusudan. Verifying security invariants in ExpressOS. In ASPLOS'13, pages 293-304. ACM, 2013.
30. G. Nelson. Verifying reachability invariants of linked structures. In POPL'83, pages 38-47. ACM, 1983.
31. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science. Springer, 2002.
32. 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.
33. 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.
34. 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.
35. 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.
36. J. Reynolds. Separation logic: a logic for shared mutable data structures. In LICS'02, pages 55-74. IEEE-CS, 2002.
37. 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.
38. J. Smans, B. Jacobs, and F. Piessens. Implicit dynamic frames. ACM Trans. Program. Lang. Syst., 34(1):2:1-2:58, 2012.
39. P. Suter, M. Dotta, and V. Kuncak. Decision procedures for algebraic data types with abstractions. In POPL'10, pages 199-210. ACM, 2010.
40. P. Suter, A. S. Köksal, and V. Kuncak. Satisfiability modulo recursive programs. In SAS'11, volume 6887 of LNCS, pages 298-315. Springer, 2011.
41. H. Yang, O. Lee, J. Berdine, C. Calcagno, B. Cook, D. Distefano, and P. W. O'Hearn. Scalable shape analysis for systems code. In CAV'08, volume 5123 of LNCS, pages 385-398. Springer, 2008.
42. J. Yang and C. Hawblitzel. Safe to the last instruction: automated verification of a type-safe operating system. In PLDI'10, pages 99-110. ACM, 2010.
43. K. Zee, V. Kuncak, and M. C. Rinard. Full functional verification of linked data structures. In PLDI'08, pages 349-361. ACM, 2008.
44. K. Zee, V. Kuncak, and M. C. Rinard. An integrated proof language for imperative programs. In PLDI'09, pages 338-351. ACM, 2009.