Looking at Separation Algebras with Boolean BI-eyes

Dominique Larchey-Wendling (1) , Didier Galmiche (1)

1 TYPES - Logic, proof Theory and Programming

In this paper, we show that the formulæ of Boolean BI cannot distinguish between some of the different notions of separation algebra found in the literature: partial commutative monoids, either cancellative or not, with a single unit or not, all define the same notion of validity. We obtain this result by the careful study of the specific properties of the counter-models that are generated by tableaux proof-search in Boolean BI

Mots clés: Boolean BI; Abstract Separation Logic

Domaines: Informatique [cs]; Logique en informatique [cs.LO]

Dominique Larchey-Wendling, Didier Galmiche. Looking at Separation Algebras with Boolean BI-eyes . 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp. 326-340, ⟨10.1007/978-3-662-44602-7_25⟩. ⟨hal-01256804⟩