On the almighty wand

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

Volumn 5213 LNCS, Issue , 2008, Pages 323-338

  Brochenin, Rémi ^a   Demri, Stéphane ^a   Lozes, Etienne ^a  

^a INRIA SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; CRYSTAL LATTICES; FORMAL LOGIC; RECURSIVE FUNCTIONS; SEPARATION; SONOLUMINESCENCE; TECHNICAL PRESENTATIONS;

BINARY RELATIONS; EXPRESSIVE POWERS; FINITE WORDS; FIRST ORDERS; PREDICATE LOGICS; SATISFIABILITY; SEPARATION LOGICS; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY;

EID: 57849145228     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87531-424     Document Type: Conference Paper

References (28)

1. Berdine, J., Calcagno, C., O'Hearn, P.: A decidable fragment of separation logic. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 97-109. Springer, Heidelberg (2004)
2. Brochenin, R., Demri, S., Lozes, E.: Reasoning about sequences of memory states. In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 100-114. Springer, Heidelberg (2007)
3. Brochenin, R., Demri, S., Lozes, E.: On the almighty wand. Technical report, LSV, ENS de Cachan (2008)
4. Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, Heidelberg (1997)
5. Bouajjani, A., Habermehl, P., Moro, P., Vojnar, T.: Verifying programs with dynamic 1-selector-linked structured in regular model-checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 13-29. Springer, Heidelberg (2005)
6. Bozga, M., Iosif, R., Lakhnech, Y.: On logics of aliasing. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3.148, pp. 344-360. Springer, Heidelberg (2004)
7. Bozga, M., Iosif, R., Peramau, S.: Quantitative separation logic and programs with lists. In: IJCAR 2008 (to appear, 2008)
8. Calcagno, C., Gardner, P., Hague, M.: From separation logic to first-order logic. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 395-409. Springer, Heidelberg (2005)
9. Calcagno, C., Yang, H., O'Hearn, P.: Computability and complexity results for a spatial assertion language. In: APLAS 2001, pp. 289-300 (2001)
10. Calcagno, C., Yang, H., O'Hearn, P.: Computability and complexity results for a spatial assertion language for data structures. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 108-119. Springer, Heidelberg (2001)
11. Dawar, A., Gardner, P., Ghelli, G.: Adjunct elimination through games in static ambient logic. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 211-223. Springer, Heidelberg (2004)
12. Dawar, A., Gardner, P., Ghelli, G.: Expressiveness and complexity of graph logic. I&C205(3), 263-310 (2007)
13. Galmiche, D., Méry, D.: Tableaux and resource graphs for separation logic (submitted, 2008) [IO01] Ishtiaq, S., O'Hearn, P.: BI as an assertion language for mutable data structures. In: POPL 2001, pp. 14-26 (2001)
14. Jensen, J., Jorgensen, M., Klarlund, N., Schwartzbach, M.: Automatic verification of pointer programs using monadic second-order logic. In: PLDI 1997, pp. 226-236. ACM, New York (1997)
15. Klaedtke, F., Rueb, H.: Monadic second-order logics with cardinalities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 681-696. Springer, Heidelberg (2003)
16. Kuncak, V., Rinard, M.: On spatial conjunction as second-order logic. Technical report, MIT CSAIL (October 2004)
17. Lev-Ami, T., Sagiv, M.: TVLA: A system for implementing static analyses. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, pp. 280-302. Springer, Heidelberg (2000)
18. Lozes, E.: Separation logic preserves the expressive power of classical logic. In: 2nd Workshop on Semantics, Program Analysis, and Computing Environments for Memory Management (SPACE 2004) (2004)
19. Lozes, E.: Elimination of spatial connectives in static spatial logics. TCS 330(3), 475-499 (2005)
20. Löding, C., Rohde, P.: Model checking and satisfiability for sabotage modal logic. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 302-313. Springer, Heidelberg (2003)
21. Marcinkowski, J.: On the expressive power of graph logic. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 486-500. Springer, Heidelberg (2006)
22. Magill, S., Berdine, J., Clarke, E., Cook, B.: Arithmetic strengthening for shape analysis. In: Riis Nielson, H., Filé, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 419-436. Springer, Heidelberg (2007)
23. Rabin, M.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 41, 1-35 (1969)
24. Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: LICS 2002, pp. 55-74. IEEE, Los Alamitos (2002)
25. Ranise, S., Zarba, C.: A theory of singly-linked lists and its extensible decision procedure. In: SEFM 2006, pp. 206-215. IEEE, Los Alamitos (2006)
26. Stockmeyer, L.: The complexity of decision problems in automata theory and logic. PhD thesis, Department of Electrical Engineering. MIT (1974)
27. Trakhtenbrot, B.A.: The impossibility of an algorithm for the decision problem for finite models. Dokl. Akad. Nauk SSSR 70, 566-572 (1950); English translation in: AMS Transl. Ser. 2, 23(1063), 1-6
28. Yorsh, G., Rabinovich, A.M., Sagiv, M., Meyer, A., Bouajjani, A.: A logic of reachable patterns in linked data structures. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 94-110. Springer, Heidelberg (2005)