Resource Models and Proofs in Bunched Implications Logic

Didier Galmiche 1
1 TYPES - Logic, proof Theory and Programming
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this talk, we present, after an analysis of the BI models, a theory of semantic proof-search for BI, that is based on the use of algebras of labels in order to solve the resource-distribution and sharing problems. Therefore, we deduce methods that generate proofs or countermodels in BI. As consequences, we have two strong results for propositional BI: decidability and finite model property, and we also propose, a new resource semantics, based on partially defined monoids, which generalizes the semantics of BI's pointer logic and for which BI is complete. We analyse the consequences of these proof-theoretic and semantics results about BI in the context of separation and spatial logics (specifications and proofs of programs or distributed concurrent systems).
Type de document :
Communication dans un congrès
First APPSEM-II Workshop 2003 - (Applied Semantics II), 2003, Nottingham/UK, 2003
Liste complète des métadonnées

https://hal.inria.fr/inria-00099552
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 09:38:32
Dernière modification le : mardi 24 avril 2018 - 13:34:49

Identifiants

  • HAL Id : inria-00099552, version 1

Collections

Citation

Didier Galmiche. Resource Models and Proofs in Bunched Implications Logic. First APPSEM-II Workshop 2003 - (Applied Semantics II), 2003, Nottingham/UK, 2003. 〈inria-00099552〉

Partager

Métriques

Consultations de la notice

145