Abstract
In this paper, we study Boolean BI Logic (BBI) from a semantic perspective. This logic arises as a logical basis of some recent separation logics used for reasoning about mutable data structures and we aim at proposing new results from alternative semantic foundations for BBI that seem to be necessary in the context of modeling and proving program properties. Starting from a Kripke relational semantics for BBI which can also be viewed as a non-deterministic monoidal semantics, we first show that BBI includes some S4-like modalities and deduce new results: faithful embeddings of S4 modal logic, and then of intuitionistic logic (IL) into BBI, despite of the classical nature of its additive connectives. Moreover, we provide a logical characterization of the observational power of BBI through an adequate definition of bisimulation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blackburn, P., de Rijke, M., Venema, Y.: Modal logic. Cambridge University Press, New York (2001)
Caires, L., Cardelli, L.: A spatial logic for concurrency (Part II). In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 209–225. Springer, Heidelberg (2002)
Caires, L., Lozes, É.: Elimination of quantifiers and undecidability in spatial logics for concurrency. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 240–257. Springer, Heidelberg (2004)
Davey, B., Priestley, H.: Introduction to Lattices and Order. In: Cambridge Mathematical Textbooks. Cambridge University Press, Cambridge (1990)
Dawar, A., Gardner, P., Ghelli, G.: Adjunct elimination through games in static ambient logic(Extended abstract). In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 211–223. Springer, Heidelberg (2004)
Galmiche, D., Méry, D.: Semantic labelled tableaux for propositional BI without bottom. Journal of Logic and Computation 13(5), 707–753 (2003)
Galmiche, D., Méry, D.: Characterizing provability in BI’s pointer logic through resource graphs. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 459–473. Springer, Heidelberg (2005)
Galmiche, D., Méry, D., Pym, D.: The semantics of BI and Resource Tableaux. Math. Struct. in Comp. Science 15(6), 1033–1088 (2005)
Ishtiaq, S., O’Hearn, P.: BI as an assertion language for mutable data structures. In: 28th ACM Symposium on Principles of Programming Languages, London, pp. 14–26 (2001)
Milner, R.: Communication and Concurrency. International series in computer science. Prentice-Hall, Englewood Cliffs (1989)
O’Hearn, P.W., Reynolds, J.C., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 1–19. Springer, Heidelberg (2001)
Pym, D.: The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logic Series, vol. 26. Kluwer Academic Publishers, Dordrecht (2002)
Pym, D., Tofts, C.: A calculus and logic of resources and processes. Technical Report HPL-2004-170, HP Labs (2004)
Reynolds, J.: Separation logic: A logic for shared mutable data structures. In: IEEE Symposium on Logic in Computer Science, Copenhagen, July 2002, pp. 55–74 (2002)
Statman, R.: Intuitionistic Propositional Logic is Polynomial-Space Complete. Theoretical Computer Science 9, 67–72 (1979)
Yang, H.: Ternary-relation Models of Boolean BI: Soundness and Completeness (unpublished note) (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galmiche, D., Larchey-Wendling, D. (2006). Expressivity Properties of Boolean BI Through Relational Models. In: Arun-Kumar, S., Garg, N. (eds) FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2006. Lecture Notes in Computer Science, vol 4337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11944836_33
Download citation
DOI: https://doi.org/10.1007/11944836_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49994-7
Online ISBN: 978-3-540-49995-4
eBook Packages: Computer ScienceComputer Science (R0)