Efficient decision procedures for heaps using strand

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

Volumn 6887 LNCS, Issue , 2011, Pages 43-59

  Madhusudan, P ^a   Qiu, Xiaokang ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROCEDURE; EFFICIENT ALGORITHM; VERIFICATION CONDITION;

ALGORITHMS; DECISION THEORY; PLANT EXTRACTS; SEMANTICS; STATIC ANALYSIS; TREES (MATHEMATICS);

COMPUTABILITY AND DECIDABILITY;

EID: 80053118907     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23702-7_8     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. Berdine, J., Calcagno, C., O'Hearn, P.W.: A decidable fragment of separation logic. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 97-109. Springer, Heidelberg (2004) (Pubitemid 39740216)
3. Bjørner, N., Hendrix, J.: Linear functional fixed-points. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 124-139. Springer, Heidelberg (2009)
4. 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)
5. Habermehl, P., Iosif, R., Vojnar, T.: Automata-based verification of programs with tree updates. Acta Informatica 47(1), 1-31 (2010)
6. Klarlund, N., Møller, A.: MONA. BRICS, Department of Computer Science, Aarhus University (January 2001), http://www.brics.dk/mona/
7. Klarlund, N., Schwartzbach, M.I.: Graph types. In: POPL 1993, pp. 196-205. ACM, New York (1993) (Pubitemid 23631644)
8. Kuncak, V.: Modular Data Structure Verification. Ph.D. thesis, Massachusetts Institute of Technology (2007)
9. Lahiri, S., Qadeer, S.: Back to the future: revisiting precise program verification using SMT solvers. In: POPL 2008, pp. 171-182. ACM, New York (2008)
10. Madhusudan, P., Parlato, G., Qiu, X.: Decidable logics combining heap structures and data. In: POPL 2011, pp. 611-622. ACM, New York (2011)
11. Magill, S., Tsai, M.H., Lee, P., Tsay, Y.K.: THOR: A tool for reasoning about shape and arithmetic. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 428-432. Springer, Heidelberg (2008)
12. McPeak, S., Necula, G.C.: Data structure specifications via local equality axioms. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 476-490. Springer, Heidelberg (2005) (Pubitemid 41431758)
13. Møller, A., Schwartzbach, M.I.: The pointer assertion logic engine. In: PLDI 2001, pp. 221-231. ACM, New York (2001)
14. Nelson, G.: Verifying reachability invariants of linked structures. In: POPL 1983, pp. 38-47. ACM, New York (1983) (Pubitemid 14477105)
15. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Syst. 1, 245-257 (1979)
16. Rakamaríc, Z., Bingham, J.D., Hu, A.J.: An inference-rule-based decision procedure for verification of heap-manipulating programs with mutable data and cyclic data structures. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 106-121. Springer, Heidelberg (2007) (Pubitemid 350143488)
17. Rakamaríc, Z., Bruttomesso, R., Hu, A.J., Cimatti, A.: Verifying heap-manipulating programs in an SMT framework. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Oka-mura, Y. (eds.) ATVA2007. LNCS, vol.4762, pp.237-252. Springer, Heidelberg (2007)
18. Ranise, S., Zarba, C.: A theory of singly-linked lists and its extensible decision procedure. In: SEFM 2006, pp. 206-215. IEEE-CS, Los Alamitos (2006)
19. Reynolds, J.: Separation logic: a logic for shared mutable data structures. In: LICS 2002, pp. 55-74. IEEE-CS, Los Alamitos (2002)
20. Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Languages, pp. 389-456. Springer, Heidelberg (1997)
21. Yorsh, G., Rabinovich, A.M., Sagiv, M., Meyer, A., Bouajjani, A.: A logic of reachable patterns in linked data-structures. In: Aceto, L., Ingólfsdóttir, A. (eds.) FoS-SaCS 2006. LNCS, vol. 3921, pp. 94-110. Springer, Heidelberg (2006) (Pubitemid 44019334)