Resource tableaux - (extended abstract)
Galmiche, D., Mery, D. and Pym, D., 2002. Resource tableaux - (extended abstract). In: Bradfield, J., ed. Computer Science Logic. Vol. 2471. Berlin, Germany: Springer, pp. 183-199. (Lecture Notes in Computer Science; 2471)
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
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 for BI's tableaux to solve the resource-distribution problem, the labels being the elements of resource models. For BI with inconsistency, perpendicular to, 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, by considering partially defined monoids, a new semantics which generalizes the semantics of BI's pointer logic and for which BI is complete.
|Item Type||Book Sections|
|Creators||Galmiche, D., Mery, D. and Pym, D.|
|Uncontrolled Keywords||tableaux, resources, decidability, semantics, finite model property, bi, logic|
|Departments||Faculty of Science > Computer Science|
|Additional Information||ID number: ISI:000187294300013|
Actions (login required)