In the quest for tractable methods for reasoning about concurrent algorithms both
rely/guarantee logic and separation logic have made great advances. They both seek to …

We investigate decidability, complexity and expressive power issues for (first-order)
separation logic with one record field (herein called SL) and its fragments. SL can specify …

In this paper, we close the logical gap between provability in the logic BBI, which is the
propositional basis for separation logic, and validity in an intended class of separation …

We formulate a unified display calculus proof theory for the four principal varieties of
bunched logic by combining display calculi for their component logics. Our calculi satisfy cut …

This paper explores a unification of the ideas of Concurrent Separation Logic with those of
Communicating Sequential Processes. It extends separation logic by an operator for …

The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in
English, and is therefore not compositional and not complete. We provide a first step towards …

Like modal logic, temporal logic, and description logic, separation logic has become a
popular class of logical formalisms in computer science, conceived as assertion languages …

The logic of Bunched Implications, through both its intuitionistic version (BI) and one of its
classical versions, called Boolean BI (BBI), serves as a logical basis to spatial or separation …

We present Classical BI (CBI), a new addition to the family of bunched logics which
originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from existing …

We investigate intermediate logics between the bunched logics Boolean BI and Classical BI,
obtained by combining classical propositional logic with various flavours of Hyland and De …