{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T05:20:15Z","timestamp":1740374415976,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206804"},{"type":"electronic","value":"9783540245971"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24597-1_3","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:39:20Z","timestamp":1280389160000},"page":"23-37","source":"Crossref","is-referenced-by-count":6,"title":["A Separation Logic for Resource Distribution"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Biri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didier","family":"Galmiche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Ahmed, A., Jia, L., Walker, D.: Reasoning about hierarchical storage. In: 18th IEEE Symposium on Logic in Computer Science, Ottawa, Canada, pp. 33\u201343 (2003)","key":"3_CR1","DOI":"10.1109\/LICS.2003.1210043"},{"unstructured":"Biri, N., Galmiche, D.: A modal linear logic for distribution and mobility. In: FLOC 2002 Workshop on Linear Logic, Copenhagen, Denmark (July 2002)","key":"3_CR2"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45500-0_1","volume-title":"Theoretical Aspects of Computer Software","author":"L. Caires","year":"2001","unstructured":"Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 1\u201337. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"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)","key":"3_CR4","DOI":"10.1145\/604174.604183"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-45294-X_10","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"C. Calcagno","year":"2001","unstructured":"Calcagno, C., Yang, H., O\u2019Hearn, 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.\u00a02245, pp. 108\u2013119. Springer, Heidelberg (2001)"},{"unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: Querying trees with pointers (2003) (draft)","key":"3_CR6"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45309-1_1","volume-title":"Programming Languages and Systems","author":"L. Cardelli","year":"2001","unstructured":"Cardelli, L., Ghelli, G.: A query language based on the Ambient Logic. In: Sands, D. (ed.) ESOP 2001. LNCS, vol.\u00a02028, pp. 1\u201322. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"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\u201313 (2000)","key":"3_CR8","DOI":"10.1145\/325694.325742"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-44802-0_24","volume-title":"Computer Science Logic","author":"W. Charatonik","year":"2001","unstructured":"Charatonik, W., Talbot, J.M.: The decidability of model checking mobile ambients. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 339\u2013354. Springer, Heidelberg (2001)"},{"key":"3_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-45620-1_8","volume-title":"Automated Deduction - CADE-18","author":"D. Galmiche","year":"2002","unstructured":"Galmiche, D., M\u00e9ry, D.: Connection-based proof search in propositional BI logic. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 111\u2013128. Springer, Heidelberg (2002)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-45793-3_13","volume-title":"Computer Science Logic","author":"D. Galmiche","year":"2002","unstructured":"Galmiche, D., M\u00e9ry, D., Pym, D.: Resource Tableaux (extended abstract). In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 183\u2013199. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Ishtiaq, S., O\u2019Hearn, 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\u201326 (2001)","key":"3_CR12","DOI":"10.1145\/373243.375719"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44802-0_1","volume-title":"Computer Science Logic","author":"P.W. O\u2019Hearn","year":"2001","unstructured":"O\u2019Hearn, 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.\u00a02142, pp. 1\u201319. Springer, Heidelberg (2001)"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2307\/421090","volume":"5","author":"P.W. O\u2019Hearn","year":"1999","unstructured":"O\u2019Hearn, P.W., Pym, D.: The Logic of Bunched Implications. Bulletin of Symbolic Logic\u00a05(2), 215\u2013244 (1999)","journal-title":"Bulletin of Symbolic Logic"},{"key":"3_CR15","series-title":"Applied Logic Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-0091-7","volume-title":"The Semantics and Proof Theory of the Logic of Bunched Implications","author":"D.J. Pym","year":"2002","unstructured":"Pym, D.J.: The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logic Series, vol.\u00a026. Kluwer Academic Publishers, Dordrecht (2002)"},{"doi-asserted-by":"crossref","unstructured":"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\u201374 (2002)","key":"3_CR16","DOI":"10.1109\/LICS.2002.1029817"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24597-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T15:21:02Z","timestamp":1740324062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24597-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206804","9783540245971"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24597-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}