An efficient decision procedure for imperative tree data structures

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

Volumn 6803 LNAI, Issue , 2011, Pages 476-491

  Wies, Thomas ^a   Muñiz, Marco ^b   Kuncak, Viktor ^c  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b UNIVERSITY OF FREIBURG   (Germany)

^c EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURE INVARIANTS; DECISION PROCEDURE; LOW COMPLEXITY; MONADIC SECOND-ORDER LOGIC; REACHABILITY CONSTRAINTS; SATISFIABILITY; SOFTWARE VERIFICATION; TRANSITIVE CLOSURE; TREE DATA STRUCTURES; WEAKEST PRECONDITION;

AUTOMATION; COMPUTABILITY AND DECIDABILITY; DATA STRUCTURES; PLANT EXTRACTS; VERIFICATION;

TREES (MATHEMATICS);

EID: 80051690412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22438-6_36     Document Type: Conference Paper

References (21)

1. Balaban, I., Pnueli, A., Zuck, L.D.: Shape analysis of single-parent heaps. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 91-105. Springer, Heidelberg (2007) (Pubitemid 350143487)
2. Bouajjani, A., Drǎgoi, C., Enea, C., Sighireanu, M.: A logic-based framework for reasoning about composite data structures. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 178-195. Springer, Heidelberg (2009)
3. Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular tree model checking of complex dynamic data structures. In: Penkler, D., Reitenspiess, M., Tam, F. (eds.) SAS 2006. LNCS, vol. 4328, Springer, Heidelberg (2006)
4. Calvanese, D., di Giacomo, G., Nardi, D., Lenzerini, M.: Reasoning in expressive description logics. In: Handbook of Automated Reasoning. Elsevier, Amsterdam (2001)
5. Charatonik, W.,Witkowski, P.: On the complexity of the bernays-schönfinkel class with datalog. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 187-201. Springer, Heidelberg (2010)
6. de Moura, L., Bjørner, N.S.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
7. Genevès, P., Layaïda, N., Schmitt, A.: Efficient static analysis of XML paths and types. In: ACM PLDI (2007)
8. Habermehl, P., Iosif, R., Vojnar, T.: Automata-based verification of programs with tree updates. Acta Inf. 47, 1-31 (2010)
9. Ihlemann, C., Jacobs, S., Sofronie-Stokkermans, V.: On local reasoning in verification. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 265-281. Springer, Heidelberg (2008)
10. Immerman, N., Rabinovich, A.M., Reps, T.W., Sagiv, M., Yorsh, G.: The boundary between decidability and undecidability for transitive-closure logics. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 160-174. Springer, Heidelberg (2004) (Pubitemid 39751586)
11. Klarlund, N., Møller, A.: MONA Version 1.4 User Manual. BRICS Notes Series NS-01-1, Department of Computer Science, University of Aarhus (January 2001)
12. Kuncak, V.: Modular Data Structure Verification. PhD thesis, EECS Department, Massachusetts Institute of Technology (February 2007)
13. Lahiri, S., Qadeer, S.: Back to the future: revisiting precise program verification using SMT solvers. In: POPL (2008)
14. Lev-Ami, T., Immerman, N., Reps, T., Sagiv, M., Srivastava, S., Yorsh, G.: Simulating reachability using first-order logic with applications to verification of linked data structures. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 99-115. Springer, Heidelberg (2005)
15. Podelski, A.,Wies, T.: Counterexample-guided focus. In: ACMSymposium on the Principles of Programming Languages (POPL 2010), pp. 249-260. ACM, New York (2010)
16. Sofronie-Stokkermans, V.: Hierarchic reasoning in local theory extensions. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 219-234. Springer, Heidelberg (2005)
17. Wies, T.: Symbolic Shape Analysis. PhD thesis, University of Freiburg (2009)
18. Wies, T., Kuncak, V., Lam, P., Podelski, A., Rinard, M.: Field constraint analysis. In: Proc. Int. Conf. Verification, Model Checking, and Abstract Interpratation (2006)
19. Wies, T., Muñiz, M., Kuncak, V.: On an efficient decision procedure for imperative tree data structures. Technical Report IST-2011-0005, EPFL-REPORT-165193, IST Austria, EPFL (2011)
20. Yorsh, G., Rabinovich, A.M., Sagiv, M., Meyer, A., Bouajjani, A.: A logic of reachable patterns in linked data-structures. J. Log. Algebr. Program. (2007)
21. Zee, K., Kuncak, V., Rinard, M.: Full functional verification of linked data structures. In: PLDI (2008)