Undecidability of propositional separation logic and its neighbours

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2010, Pages 130-139

  Brotherston, James ^a   Kanovich, Max ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SEPARATION;

DIRECT ENCODING; SEPARATION LOGIC; UNDECIDABILITY;

COMPUTER CIRCUITS;

EID: 78449267893     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2010.24     Document Type: Conference Paper

References (25)

1. A. Ahmed, L. Jia, and D. Walker. Reasoning about hierarchical storage. In Proc. LICS-18, pp.33-44, 2003.
2. J. Berdine, C. Calcagno, and P. O'Hearn. A decidable fragment of separation logic. In Proc. FSTTCS, 2004.
3. R. Bornat, C. Calcagno, P. O'Hearn, and M. Parkinson. Permission accounting in separation logic. In Proc. POPL-32, pp.59-70, 2005.
4. J. Brotherston and C. Calcagno. Classical BI (A logic for reasoning about dualising resource). In Proc. POPL-36, pp.328-339, 2009.
5. C. Calcagno, D. Distefano, P. O'Hearn, and H. Yang. Compositional shape analysis by means of bi-abduction. In Proc. POPL-36, pp.289-300, 2009.
6. C. Calcagno, P. O'Hearn, and H. Yang. Local action and abstract separation logic. In Proc. LICS-22, pp.366-378, 2007.
7. C. Calcagno, H. Yang, and P. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In Proc. FSTTCS, pp.108-119, 2001.
8. D. Distefano and M. Parkinson. jStar: Towards practical verification for Java. In Proc. OOPSLA, pp.213-226, 2008.
9. M. Dodds, X. Feng, M. Parkinson, and V. Vafeiadis. Deny-guarantee reasoning. In Proc. ESOP, pp.363-377, 2009.
10. D. Foulis and M. Bennett. Effect algebras and unsharp quantum logics. Foundations of Physics, 24:1331-1352, 1994.
11. D. Galmiche and D. Larchey-Wendling. Undecidability of Boolean BI through phase semantics. LICS-2010, to appear.
12. D. Galmiche, D. Mery, and D. Pym. The semantics of BI and resource tableaux. Mathematical Structures in Computer Science, 15:1033-1088, 2005.
13. A. Gotsman, B. Cook, M. Parkinson, and V. Vafeiadis. Proving that non-blocking algorithms don't block. In Proc. POPL-36, pp.16-28, 2009.
14. S. Ishtiaq and P. O'Hearn. BI as an assertion language for mutable data structures. In Proc. POPL-28, 2001.
15. M. Kanovich. The direct simulation of Minsky machines in linear logic. In Advances in Linear Logic, pp.123-145, 1995.
16. M. Kanovich. Petri nets, Horn programs, linear logic, and vector games, Annals of Pure and Applied Logic, 75:107-135, 1995.
17. A. Kurucz, I. Nemeti, I. Sain and A. Simon. Decidable and undecidable modal logics with a binary modality, J. Logic, Language and Information, 4 (1995), 191-206.
18. P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56(1-3):239-311, 1992.
19. M. Minsky. Computation: finite and infinite machines, 1967.
20. P. O'Hearn and D. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215-244, June 1999.
21. M. Parkinson and G. Bierman. Separation logic, abstraction and inheritance. In Proc. POPL-35, 2008.
22. M. Parkinson, R. Bornat, and C. Calcagno. Variables as resource in Hoare logics. In Proc. LICS, pp.137-146, 2006.
23. D. Pym. The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logic Series, Kluwer, 2002.
24. J. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. 17th LICS, 2002.
25. H. Yang, O. Lee, J. Berdine, C. Calcagno, B. Cook, D. Distefano, and P. O'Hearn. Scalable shape analysis for systems code. In Proc. CAV, 2008.