{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T22:13:20Z","timestamp":1794348800471,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540738572","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73859-6_8","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T07:37:02Z","timestamp":1187681822000},"page":"111-125","source":"Crossref","is-referenced-by-count":0,"title":["Datatypes in Memory"],"prefix":"10.1007","author":[{"given":"David","family":"Aspinall","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Piotr","family":"Hoffman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Reynolds, J.: Separation logic: A logic for shared mutable data structures. In: LICS 2002, pp. 55\u201374 (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N., Berger, M.: An observationally complete program logic for imperative higher-order frame rules. LICS 2005, pp. 270\u2013279 (2005)","DOI":"10.1109\/LICS.2005.5"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Aspinall, D., Beringer, L., Hofmann, M., Loidl, H.W., Momigliano, A.: A program logic for resources. Theoretical Computer Science (accepted, 2007)","DOI":"10.1016\/j.tcs.2007.09.003"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Petersen, L., Harper, R., Crary, K., Pfenning, F.: A type theory for memory allocation and data layout. POPL 2003, pp. 172\u2013184 (2003)","DOI":"10.1145\/604131.604147"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11924661_7","volume-title":"Programming Languages and Systems","author":"N. Benton","year":"2006","unstructured":"Benton, N., Kennedy, A., Hofmann, M., Beringer, L.: Reading, writing and relations. In: Kobayashi, N. (ed.) APLAS 2006. LNCS, vol.\u00a04279, pp. 114\u2013130. Springer, Heidelberg (2006)"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.tcs.2003.11.020","volume":"315","author":"D. Pym","year":"2004","unstructured":"Pym, D., O\u2019Hearn, P., Yang, H.: Possible worlds and resources: The semantics of BI. Theoretical Computer Science\u00a0315(1), 257\u2013305 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0304-3975(02)00366-3","volume":"291","author":"B. Jacobs","year":"2003","unstructured":"Jacobs, B., Poll, E.: Coalgebras and monads in the semantics of Java. TCS\u00a0291(3), 329\u2013349 (2003)","journal-title":"TCS"},{"issue":"4","key":"8_CR8","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1093\/logcom\/14.4.571","volume":"14","author":"L. Schr\u00f6der","year":"2004","unstructured":"Schr\u00f6der, L., Mossakowski, T.: Monad-independent dynamic logic in HasCasl. J. Log. Comput.\u00a014(4), 571\u2013619 (2004)","journal-title":"J. Log. Comput."},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/S0304-3975(02)00868-X","volume":"298","author":"C. Calcagno","year":"2003","unstructured":"Calcagno, C., O\u2019Hearn, P., Bornat, R.: Program logic and equivalence in the presence of garbage collection. TCS\u00a0298(3), 557\u2013581 (2003)","journal-title":"TCS"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Benton, N.: Simple relational correctness proofs for static analyses and program transformations. In: POPL 2004, pp. 14\u201325 (2004)","DOI":"10.1145\/964001.964003"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0304-3975(99)00275-3","volume":"245","author":"J. Goguen","year":"2000","unstructured":"Goguen, J., Malcolm, G.: A hidden agenda. TCS\u00a0245(1), 55\u2013101 (2000)","journal-title":"TCS"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/3-540-40911-4_2","volume-title":"Integrated Formal Methods","author":"H. Baumeister","year":"2000","unstructured":"Baumeister, H., Zamulin, A.: State-based extension of CASL. In: Grieskamp, W., Santen, T., Stoddart, B. (eds.) IFM 2000. LNCS, vol.\u00a01945, pp. 3\u201324. Springer, Heidelberg (2000)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-49253-4_20","volume-title":"Algebraic Methodology and Software Technology","author":"R. Hennicker","year":"1999","unstructured":"Hennicker, R., Bidoit, M.: Observational logic. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol.\u00a01548, pp. 263\u2013277. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73859-6_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:58:58Z","timestamp":1737363538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73859-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738572"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73859-6_8","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-73859-6","asserted-by":"object"}]},"subject":[]}}