The logic of bunched implications, BI, provides a logical analysis of a basic notion of resource that is rich enough, for example, to form the logical basis for ‘pointer logic’ and ‘separation Logic’ semantics.Expand

We present a proof-theoretic foundation for automated deduction in linear logic by exploiting the permutability properties of inference rules in this logical framework.Expand

We study semantic labelled tableaux for the propositional Bunched Implications logic (BI) that captures interferences between resources and it is well suited, because of its resource-based sharing interpretation, for reasoning about mutable data structures.Expand

We propose a sound and complete syntactic constraints based framework for the Kripke semantics of both BI and BBI, a sound labelled tableau proof system for BBI.Expand

The logic of bunched implications BI provides a logical analysis of a basic notion of resource rich enough to provide a ``pointer logic'' semantics for programs which manipulate mutable data structures.Expand