Models and Separation Logics for Resource Trees

Nicolas Biri 1 Didier Galmiche 1
1 TYPES - Logic, proof Theory and Programming
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this article, we propose a new data structure, called resource tree, that is a node-labelled tree in which nodes contain resources which belong to a partial monoid. We define the resource tree model and a new separation logic (BI-Loc) that extends the Bunched Implications logic (BI) with a modality for locations. In addition, we consider quantifications on locations and paths and then we study decidability by model-checking in these models and logics. Moreover, we define a language to deal with resource trees and also an assertion logic derived from BI-Loc. Then soundness and completeness issues are studied, and we show how the model and its associated language can be used to manage heap structures and also permission accounting.
Document type :
Journal articles
Complete list of metadatas
Contributor : Didier Galmiche <>
Submitted on : Thursday, October 4, 2007 - 3:46:21 PM
Last modification on : Tuesday, April 24, 2018 - 1:33:54 PM

Links full text




Nicolas Biri, Didier Galmiche. Models and Separation Logics for Resource Trees. Journal of Logic and Computation, Oxford University Press (OUP), 2007, 17 (4), pp.687-726. ⟨10.1093/logcom/exm019⟩. ⟨hal-00176793⟩



Record views