Expressivity Properties of Boolean BI Through Relational Models

DOI10.1007/11944836_33zbMath1168.03326OpenAlexW1714661887MaRDI QIDQ5385999

Dominique Larchey-Wendling, Didier Galmiche

Publication date: 17 April 2008

Published in: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11944836_33

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

A stone-type duality theorem for separation logic via its underlying bunched logics, Bringing Order to the Separation Logic Jungle, A Unified Display Proof Theory for Bunched Logic, An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics, Undecidability of Propositional Separation Logic and Its Neighbours, Convolution and concurrency, Proof tactics for assertions in separation logic, Bunched logics displayed, An algebraic glimpse at bunched implications and separation logic, Unnamed Item, Unnamed Item, On Model Checking Boolean BI