Decidable logics combining heap structures and data

ACM SIGPLAN Notices

Volumn 46, Issue 1, 2011, Pages 611-622

  Madhusudan, P ^a   Parlato, Gennaro ^b   Qiu, Xiaokang ^a  

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

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Automata; Combining decision procedures; Decidability; Heap analysis; Monadic second order logic; SMT solvers

Indexed keywords

AUTOMATA; DECIDABILITY; DECISION PROCEDURE; HEAP ANALYSIS; MONADIC SECOND-ORDER LOGIC; SMT SOLVERS;

AUTOMATA THEORY; DECISION THEORY; TREES (MATHEMATICS);

COMPUTABILITY AND DECIDABILITY;

EID: 79251542982     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1925844.1926455     Document Type: Conference Paper

References (28)

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.
2. T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In PLDI'01, pages 203-213. ACM, 2001.
3. 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.
4. 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.
5. N. Bjørner and J. Hendrix. Linear functional fixed-points. In CAV'09, volume 5643 of LNCS, pages 124-139. Springer, 2009.
6. E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer, 2001.
7. 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.
8. L. M. de Moura and N. Bjørner. Deciding effectively propositional logic using DPLL and substitution sets. In IJCAR'08, volume 5195 of LNCS, pages 410-425. Springer, 2008.
9. 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.
10. J. Engelfriet. Context-free graph grammars. In Handbook of Formal Languages, volume 3, pages 125-214. Springer, 1997.
11. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for Java. In PLDI'02, pages 234-245. ACM, 2002.
12. P. Godefroid, N. Klarlund, and K. Sen. DART: directed automated random testing. In PLDI'05, pages 213-223. ACM, 2005.
13. N. Klarlund and A. Møller. MONA. BRICS, Department of Computer Science, Aarhus University, January 2001. Available from http://www.brics.dk/ mona/.
14. N. Klarlund and M. I. Schwartzbach. Graph types. In POPL'93, pages 196-205. ACM, 1993.
15. V. Kuncak. Modular Data Structure Verification. PhD thesis, Massachusetts Institute of Technology, 2007.
16. S. Lahiri and S. Qadeer. Back to the future: revisiting precise program verification using SMT solvers. In POPL'08, pages 171-182. ACM, 2008.
17. T. Lev-Ami and S. Sagiv. Tvla: A system for implementing static analyses. In SAS'00, volume 1824 of LNCS, pages 280-301. Springer, 2000.
18. 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.
19. S. McPeak and G. C. Necula. Data structure specifications via local equality axioms. In CAV'05, volume 3576 of LNCS, pages 476-490. Springer, 2005.
20. A. Møller and M. I. Schwartzbach. The pointer assertion logic engine. In PLDI'01, pages 221-231. ACM, 2001.
21. G. Nelson. Verifying reachability invariants of linked structures. In POPL'83, pages 38-47. ACM, 1983.
22. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Syst., 1:245-257, 1979.
23. 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.
24. 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.
25. 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.
26. J. Reynolds. Separation logic: a logic for shared mutable data structures. In LICS'02, pages 55-74. IEEE-CS, 2002.
27. G. Yorsh, T. W. Reps, and S. Sagiv. Symbolically computing mostprecise abstract operations for shape analysis. In TACAS'04, volume 2988 of LNCS, pages 530-545. Springer, 2004.
28. G. Yorsh, A. M. Rabinovich, M. Sagiv, A.Meyer, and A. Bouajjani. A logic of reachable patterns in linked data-structures. In FoSSaCS'06, volume 3921 of LNCS, pages 94-110. Springer, 2006.