{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:47:00Z","timestamp":1768423620232,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540430025","type":"print"},{"value":"9783540452942","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45294-x_10","type":"book-chapter","created":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T22:45:12Z","timestamp":1181601912000},"page":"108-119","source":"Crossref","is-referenced-by-count":74,"title":["Computability and Complexity Results for a Spatial Assertion Language for Data Structures"],"prefix":"10.1007","author":[{"given":"Cristiano","family":"Calcagno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongseok","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter W.","family":"O\u2019Hearn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,26]]},"reference":[{"key":"10_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-49099-X_2","volume-title":"A decidable logic for describing linked data structures","author":"M. Benedikt","year":"1999","unstructured":"M. Benedikt, T. Reps, and M. Sagiv. A decidable logic for describing linked data structures. In ESOP\u2019 99: European Symposium on Programming, pages 2\u201319. Lecture Notes in Computer Science, Vol. 1576, S.D. Swierstra (ed.), Springer-Verlag, New York, NY, 1999."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"W. Charatonik, S. Dal Zilio, A. Gordon, S. Mukhopadhyay, and J.M. Talbot. The complexity of model checking mobile ambients. In FoSSaCS, April 2001.","DOI":"10.1007\/3-540-45315-6_10"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995. ISBN 3-540-60149-X.","DOI":"10.1007\/3-540-28788-4"},{"key":"10_CR4","series-title":"Lect Notes Comput Sci","volume-title":"TACS","author":"D. Galmiche","year":"2001","unstructured":"D. Galmiche and D. M\u00e9ry. Proof-search and countermodel generation in propositional BI logic. In TACS, 2001. LNCS to appear."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"S. Ishtiaq and P. O\u2019Hearn. BI as an assertion language for mutable data structures. In Principles of Programming Languages, January 2001.","DOI":"10.1145\/360204.375719"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"J. Jenson, M. Jorgensen, N. Klarkund, and M. Schwartzback. Automatic verification of pointer programs using monadic second-order logic. In Proceedings of the ACM SIGPLAN\u201997 Conference on Programming Language Design and Implementation, pages 225\u2013236, 1997. SIGPLAN Notices 32(5).","DOI":"10.1145\/258915.258936"},{"key":"10_CR7","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Local reasoning about programs that alter data structures","author":"P. O\u2019Hearn","year":"2001","unstructured":"P. O\u2019Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In L. Fribourg, editor, Proceedings of 15th Annual Conference of the European Association for Computer Science Logic: CSL 2001, pages 1\u201319. Springer-Verlag, 2001. LNCS 2142."},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2307\/421090","volume":"5","author":"P. W. O\u2019Hearn","year":"1999","unstructured":"P. W. O\u2019Hearn and D. J. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215\u2013244, June 1999.","journal-title":"Bulletin of Symbolic Logic"},{"key":"10_CR9","unstructured":"J. C. Reynolds. Intuitionistic reasoning about shared mutable data structure. In Millennial Perspectives in Computer Science. Palgrave, 2000."}],"container-title":["Lecture Notes in Computer Science","FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45294-X_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T21:27:50Z","timestamp":1556486870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45294-X_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430025","9783540452942"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45294-x_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}