Models and Separation Logics for Resource Trees

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.

[1]  Luca Cardelli,et al.  Deciding validity in a spatial logic for trees , 2005, J. Funct. Program..

[2]  Nicolas Biri,et al.  A Separation Logic for Resource Distribution: Extended Abstract , 2003, FSTTCS.

[3]  Akinori Yonezawa,et al.  Distributed Concurrent Linear Logic Programming , 1999, Theor. Comput. Sci..

[4]  Luca Cardelli,et al.  A spatial logic for concurrency (part I) , 2003, Inf. Comput..

[5]  Peter W. O'Hearn,et al.  BI as an assertion language for mutable data structures , 2001, POPL '01.

[6]  David Walker,et al.  Reasoning about hierarchical storage , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[7]  D. Galmiche,et al.  A Modal Linear Logic for Distribution and Mobility - extended abstract - , 2002 .

[8]  Vladimiro Sassone,et al.  Spatial Logics for Bigraphs , 2005, ICALP.

[9]  David J. Pym,et al.  The semantics of BI and resource tableaux , 2005, Mathematical Structures in Computer Science.

[10]  Luca Cardelli,et al.  A Spatial Logic for Querying Graphs , 2002, ICALP.

[11]  Luca Cardelli,et al.  A Query Language Based on the Ambient Logic , 2001, SEBD.

[12]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

[13]  Luca Cardelli,et al.  TQL: A Query Language for Semistructured Data Based on the Ambient Logic , 2003 .

[14]  Luca Cardelli,et al.  A Spatial Logic for Concurrency (Part II) , 2002, CONCUR.

[15]  John C. Reynolds,et al.  Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[16]  M. de Rijke,et al.  Model checking hybrid logics (with an application to semistructured data) , 2006, J. Appl. Log..

[17]  David J. Pym,et al.  The semantics and proof theory of the logic of bunched implications , 2002, Applied logic series.

[18]  Luca Cardelli,et al.  Anytime, anywhere: modal logics for mobile ambients , 2000, POPL '00.

[19]  Peter W. O'Hearn,et al.  Computability and Complexity Results for a Spatial Assertion Language for Data Structures , 2001, APLAS.

[20]  D. Galmiche,et al.  Characterizing Provability in BI ’ s Pointer Logic through Resource Graphs , 2005 .

[21]  Peter W. O'Hearn,et al.  The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[22]  Peter W. O'Hearn,et al.  Permission accounting in separation logic , 2005, POPL '05.

[23]  Witold Charatonik,et al.  The Decidability of Model Checking Mobile Ambients , 2001, CSL.

[24]  Peter W. O'Hearn,et al.  Local Reasoning about Programs that Alter Data Structures , 2001, CSL.

[25]  Didier Galmiche,et al.  Semantic Labelled Tableaux for propositional BI (without bottom) , 2003 .

[26]  Didier Galmiche,et al.  Resource Graphs and Countermodels in Resource Logics , 2005, Electron. Notes Theor. Comput. Sci..

[27]  Philippa Gardner,et al.  Context logic and tree update , 2005, POPL '05.

[28]  Maarten Marx,et al.  Hybrid logics: characterization, interpolation and complexity , 2001, Journal of Symbolic Logic.