See this document in CiteSeerX!

Resource Tableaux (Extended Abstract)  (Make Corrections)  
Didier Galmiche, Daniel Méry, David Pym



  Home/Search   Context   Related

 
View or download:
loria.fr/~galmiche/=...Csl02final.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  loria.fr/~galmiche/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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 for BI's tableaux to solve the resource-distribution problem, the labels being the elements of resource models. For BI... (Update)

Similar documents (at the sentence level):
6.2%:   Under consideration for publication in Math. Struct. in Comp. .. - The Semantics Of   (Correct)

Active bibliography (related documents):   More   All
0.2:   Possible Worlds and Resources: The Semantics of BI - Pym, O'Hearn, Yang (2002)   (Correct)
0.2:   Semantic Labelled Tableaux for Propositional BI - Galmiche, Méry   (Correct)
0.2:   Resource-distribution via Boolean constraints - Harland, Pym (1997)   (Correct)

Similar documents based on text:   More   All
0.5:   Proof-search in Type-theoretic Languages: An Introduction - Galmiche, al. (2000)   (Correct)
0.3:   Proof-search and countermodel generation in propositional BI.. - Galmiche, Méry (2001)   (Correct)
0.2:   Notes Towards a Semantics for Proof-search - Pym   (Correct)

BibTeX entry:   (Update)

@misc{ galmiche-resource,
  author = "Didier Galmiche and Daniel Méry and David Pym",
  title = "Resource Tableaux (Extended Abstract)",
  url = "citeseer.ist.psu.edu/624848.html" }
Citations (may not include all citations):
322   First-Order Logic and Automated Theorem Proving (context) - Fitting - 1990  ACM
134   Labelled Deductive Systems (context) - Gabbay - 1996
110   BI as an assertion language for mutable data structures - Ishtiaq, O'Hearn - 2001  ACM   DBLP
58   The Logic of Bunched Implications (context) - O'Hearn, Pym - 1999
46   Resource-distribution via Boolean Constraints - Harland, Pym - 2003  ACM   DBLP
45   The Semantics and Proof Theory of the Logic of Bunched Impli.. (context) - Pym - 2002
23   On bunched predicate logic - Pym - 1999  ACM   DBLP
12   The finite model property for various fragments of linear lo.. - Lafont - 1997  DBLP
8   Completeness proofs for linear logic based on proof search m.. (context) - Okada, Terui - 1998
8   Proof-search and countermodel generation in propositional BI.. - Galmiche, Mry - 2001
7   Deciding provability of linear logic formulas - Lincoln - 1995  ACM
1   Yang Local Reasoning about Programs that Alter Data Structur.. (context) - O'Hearn, Reynolds - 2001
1   Labelled Deduction (context) - Balat, Galmiche - 2000  ACM
http://www.cs.bath.ac.uk/pym/recent.html

Documents on the same site (http://www.loria.fr/~galmiche/):
STRIP: Structural sharing for efficient proof-search - Larchey-Wendling..   (Correct)
Calculi with dependency relations for Mixed Linear Logic.. - Galmiche, Notin   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC