Nondeterministic phase semantics and the undecidability of Boolean BI

ACM Transactions on Computational Logic

Volumn 14, Issue 1, 2013, Pages

  Larchey Wendling, Dominique ^a   Galmiche, Didier ^b  

^a CNRS   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Boolean BI; Decidability; Linear logic; Minsky machines encoding

Indexed keywords

INTUITIONISTIC LINEAR LOGIC; KRIPKE SEMANTICS; LINEAR LOGIC; PHASE SEMANTICS; SPATIAL LOGIC; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY; LINEAR ALGEBRA;

SEMANTICS;

EID: 84876252429     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/2422085.2422091     Document Type: Article

References (27)

1. Bouajjani, A., Esparza, J., and Maler, O. 1997. Reachability analysis of pushdown automata: Application to model-checking. In Proceedings of the 8th International Conference on Concurrency Theory (CON-CUR'97). Lecture Notes in Computer Science, vol. 1243. Springer, Berlin, 135-150.
2. Brotherston, J. 2010. A unified display proof theory for bunched logic. Electr. Notes Theor. Comput. Sci. 265, 197-211.
3. Brotherston, J. and Calcagno, C. 2009. Classical BI: A logic for reasoning about dualising resources. In Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 328-339.
4. Brotherston, J. and Kanovich, M. I. 2010. Undecidability of propositional separation logic and its neighbours. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science. 130-139.
5. Calcagno, C., Cardelli, L., and Gordon, A. 2005. Deciding validity in a spatial logic for trees. J. Func. Program. 15, 4, 543-572.
6. Calcagno, C., O'Hearn, P. W., and Yang, H. 2007. Local action and abstract separation logic. In Proceedings of the 22nd IEEE Symposium on Logic in Computer Science. 366-378.
7. de Groote, P., Guillaume, B., and Salvati, S. 2004. Vector addition tree automata. In Proceedings of the 19th IEEE Symposium on Logic in Computer Science. 64-73.
8. Galmiche, D. and Larchey-Wendling, D. 2006. Expressivity properties of Boolean BI through relational models. In Proceedings of the 26th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06). Lecture Notes in Computer Science, vol. 4337. Springer, Berlin, 357-368.
9. Galmiche, D., Méry, D., and Pym, D. 2005. The semantics of BI and resource tableaux. Math. Struct. Comput. Sci. 15, 6, 1033-1088.
10. Ghilardi, S. and Meloni, G. 1990. Modal logics with n-ary connectives. Zeitschr. f. math. Logik und Grundla-gen d. Math 36, 193-215.
11. Girard, J.-Y. 1987. Linear logic. Theor. Comput. Sci. 50, 1, 1-102.
12. Ishtiaq, S. and O'Hearn, P. 2001. BI as an assertion language for mutable data structures. In Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, 14-26.
13. Kanovich, M. 1994. Linear logic as a logic of computations. Ann. Pure Appl. Logic 67, 1-3, 183-212.
14. Kanovich, M. 1995. The direct simulation of Minsky machines in linear logic. In Advances in Linear Logic, J.-Y. Girard, Y. Lafont, and L. Regnier Eds., London Mathematical Society Lecture Notes, vol. 222. Cambridge University Press, Chapter 2, 123-145.
15. Lafont, Y. 1996. The undecidability of second order linear logic without exponentials. J. Symbolic Logic 61, 2, 541-548.
16. Lafont, Y. and Scedrov, A. 1996. The undecidability of second order multiplicative linear logic. Inf. Comput. 125, 1, 46-51.
17. Larchey-Wendling, D. 2010. An alternative direct simulation of minsky machines into classical bunched logics via group semantics. Electr. Notes Theor. Comput. Sci. 265, 369-387.
18. Larchey-Wendling, D. and Galmiche, D. 2009. Exploring the relation between Intuitionistic BI and Boolean BI: An unexpected embedding. Math. Struct. Comput. Sci. 19, 3, 435-500.
19. Larchey-Wendling, D. and Galmiche, D. 2010. The undecidability of Boolean BI through phase semantics. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science. 140-149.
20. Martí-Oliet, N. and Meseguer, J. 1991. From Petri nets to linear logic. Math. Struct. Comput. Sci. 1, 1, 69-101.
21. Minsky, M. 1961. Recursive unsolvability of Post's problem of 'tag' and other topics in the theory of Turing machines. Ann. Math. 74, 3, 437-455.
22. O'Hearn, P. and Pym, D. 1999. The logic of bunched implications. Bull. Symbolic Logic 5, 2, 215-244.
23. Okada, M. 2002. A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theor. Comput. Sci. 281, 1-2, 471-498.
24. Pym, D. 2002. The semantics and proof theory of the logic of bunched implications. Applied Logic Series, vol. 26. Kluwer Academic Publishers. Errata available at http://www.cs.ac.uk/~pym/pym-tofts-fac-errata.pdf.
25. Reisig, W. 1985. Petri nets, an introduction. EATCS, Monographs on Theoretical Computer Science, Springer Verlag, Berlin.
26. Troelstra, A. 1992. Lectures on linear logic. Lecture Notes Series, vol. 29. CSLI, Stanford, CA.
27. Yetter, D. 1990. Quantales and (noncommutative) linear logic. J. Symbolic Logic 55, 1, 41-64.