# Resource Tableaux (extended abstract)

1 TYPES - Logic, proof Theory and Programming
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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. We develop a theory of semantic tableaux for BI, so providing an elegant basis for efficient theorem proving tools for BI. It is based on the use of an algebra of labels to solve the resource-distribution problem, the labels being the elements of resource models. For BI with inconsistency, the challenge consists in dealing with BI's Grothendieck topological models within such a proof-search method, based on labels. We prove soundness and completeness theorems for a resource tableaux method TBI with respect to this semantics and provide a way to build countermodels from so-called dependency graphs. As consequences, we have two strong new results for BI: the decidability of propositional BI and the finite model property with respect to Grothendieck topological semantics. In addition, we propose a new semantics which generalizes the semantics of BI's pointer logic and for which BI is complete.
Mots-clés :
Document type :
Conference papers
Domain :

https://hal.inria.fr/inria-00100798
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:51:06 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM

### Identifiers

• HAL Id : inria-00100798, version 1

### Citation

Didier Galmiche, Daniel Méry, David Pym. Resource Tableaux (extended abstract). 16th International Workshop on Computer Science Logic - CSL' 2002, 2002, Edinburgh, Scotland, UK, pp.183-199. ⟨inria-00100798⟩

Record views