Abstract
We define a separation logic (BI-Loc) that is an extension of the Bunched Implications (BI) logic with a modality for locations. Moreover, we propose a general data structure, called resource tree, that is a node-labelled tree in which nodes contain resources that belong to a partial monoid. We also define a resource tree model for this logic that allows to reason and prove properties on resource trees. We study the decidability by model checking of the satisfaction and the validity in this separation logic and also introduce a sequent calculus for deciding validity by deduction w.r.t. a resource model. Then, we relate the separation logic and resource trees to some applications and finally define a sequent calculus for BI-Loc dedicated to a theorem proving approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahmed, A., Jia, L., Walker, D.: Reasoning about hierarchical storage. In: 18th IEEE Symposium on Logic in Computer Science, Ottawa, Canada, pp. 33–43 (2003)
Biri, N., Galmiche, D.: A modal linear logic for distribution and mobility. In: FLOC 2002 Workshop on Linear Logic, Copenhagen, Denmark (July 2002)
Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 1–37. Springer, Heidelberg (2001)
Calcagno, C., Cardelli, L., Gordon, A.: Deciding validity in a spatial logic for trees. In: ACM Sigplan Workshop on Types in Language Design and Implementation, TLDI 2003, New Orleans, USA (2003)
Calcagno, C., Yang, H., O’Hearn, P.: Computability and complexity results for a spatial assertion language for data structures. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 108–119. Springer, Heidelberg (2001)
Cardelli, L., Gardner, P., Ghelli, G.: Querying trees with pointers (2003) (draft)
Cardelli, L., Ghelli, G.: A query language based on the Ambient Logic. In: Sands, D. (ed.) ESOP 2001. LNCS, vol. 2028, pp. 1–22. Springer, Heidelberg (2001)
Cardelli, L., Gordon, A.D.: Anytime, anywhere - modal logics for mobile ambients. In: 27th ACM Symposium on Principles of Programming Languages, POPL 2000, Boston, USA, pp. 1–13 (2000)
Charatonik, W., Talbot, J.M.: The decidability of model checking mobile ambients. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 339–354. Springer, Heidelberg (2001)
Galmiche, D., Méry, D.: Connection-based proof search in propositional BI logic. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 111–128. Springer, Heidelberg (2002)
Galmiche, D., Méry, D., Pym, D.: Resource Tableaux (extended abstract). In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 183–199. Springer, Heidelberg (2002)
Ishtiaq, S., O’Hearn, P.: BI as an assertion language for mutable data structures. In: 28th ACM Symposium on Principles of Programming Languages, POPL 2001, London, UK, pp. 14–26 (2001)
O’Hearn, P.W., Reynolds, J.C., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 1–19. Springer, Heidelberg (2001)
O’Hearn, P.W., Pym, D.: The Logic of Bunched Implications. Bulletin of Symbolic Logic 5(2), 215–244 (1999)
Pym, D.J.: The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logic Series, vol. 26. Kluwer Academic Publishers, Dordrecht (2002)
Reynolds, J.: Separation logic: A logic for shared mutable data structures. In: 17th IEEE Symposium on Logic in Computer Science, Copenhagen, Denmark, July 2002, pp. 55–74 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biri, N., Galmiche, D. (2003). A Separation Logic for Resource Distribution. In: Pandya, P.K., Radhakrishnan, J. (eds) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2003. Lecture Notes in Computer Science, vol 2914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24597-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-24597-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20680-4
Online ISBN: 978-3-540-24597-1
eBook Packages: Springer Book Archive