{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:41:14Z","timestamp":1725565274623},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223818"},{"type":"electronic","value":"9783540278153"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27815-3_36","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T00:32:16Z","timestamp":1284424336000},"page":"475-490","source":"Crossref","is-referenced-by-count":4,"title":["Extending Separation Logic with Fixpoints and Postponed Substitution"],"prefix":"10.1007","author":[{"given":"\u00c9lodie-Jane","family":"Sims","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","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.W.: 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, p. 108. Springer, Heidelberg (2001)"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/567752.567778","volume-title":"POPL 1979","author":"P. Cousot","year":"1979","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL 1979, San Antonio, Texas, pp. 269\u2013282. ACM Press, New York (1979)"},{"key":"36_CR3","volume-title":"Mathematical Theory of Program Correctness","author":"J.W. Bakker de","year":"1980","unstructured":"de Bakker, J.W.: Mathematical Theory of Program Correctness. Prentice Hall, Englewood Cliffs (1980)"},{"key":"36_CR4","volume-title":"A Discipline of Programming","author":"E.W. Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice Halll, Englewood Cliffs (1976)"},{"key":"36_CR5","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., Mery, 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":"36_CR6","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Comm. ACM\u00a012, 576\u2013580 (1969)","journal-title":"Comm. ACM"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Ishtiaq, S., O\u2019Hearn, P.: BI as an assertion language for mutable data structures. In: POPL 2001, pp. 14\u201326 (2001)","DOI":"10.1145\/373243.375719"},{"key":"36_CR8","volume-title":"POPL 2004","author":"H. Yang","year":"2004","unstructured":"Yang, H., O\u2019Hearn, P., Reynolds, J.: Syntactic control of interference. In: POPL 2004, Italy, ACM Press, New York (2004)"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/512760.512766","volume-title":"POPL 1978","author":"J.C. Reynolds","year":"1978","unstructured":"Reynolds, J.C.: Syntactic control of interference. In: POPL 1978, pp. 39\u201346. ACM Press, New York (1978)"},{"key":"36_CR10","first-page":"55","volume-title":"LICS 2002","author":"J.C. Reynolds","year":"2002","unstructured":"Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS 2002, Denmark, pp. 55\u201374. IEEE Computer Society, Los Alamitos (2002)"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45931-6_28","volume-title":"Foundations of Software Science and Computation Structures","author":"H. Yang","year":"2002","unstructured":"Yang, H., O\u2019Hearn, P.: A semantic basis for local reasoning. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 402\u2013416. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27815-3_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:22:30Z","timestamp":1605741750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27815-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223818","9783540278153"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27815-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}