{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:13:33Z","timestamp":1725747213026},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642397172"},{"type":"electronic","value":"9783642397189"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-39718-9_24","type":"book-chapter","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T03:01:54Z","timestamp":1377831714000},"page":"409-426","source":"Crossref","is-referenced-by-count":5,"title":["Scope Logic: An Extension to Hoare Logic for Pointers and Recursive Data Structures"],"prefix":"10.1007","author":[{"given":"Zhao","family":"Jianhua","sequence":"first","affiliation":[]},{"given":"Li","family":"Xuandong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"10","key":"24_CR1","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. Communications of the ACM\u00a012(10), 576\u2013580 (1969)","journal-title":"Communications of the ACM"},{"key":"24_CR2","first-page":"23","volume-title":"Machine Intelligence","author":"R.M. Burstall","year":"1972","unstructured":"Burstall, R.M.: Some techniques for proving correctness of programs which alter data structures. In: Machine Intelligence, vol.\u00a07, pp. 23\u201350. Edinburgh University Press, Edinburgh (1972)"},{"doi-asserted-by":"crossref","unstructured":"Cook, S.A., Oppen, D.C.: An assertion language for data structures. In: Conference Record of 2nd ACM Symposium on Priciples of Programming Languages, New York, pp. 160\u2013166 (1975)","key":"24_CR3","DOI":"10.1145\/512976.512993"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-94-009-7893-5_3","volume-title":"Theoretical Foundations of Programming Methodology","author":"J.M. Morris","year":"1982","unstructured":"Morris, J.M.: A general axiom of assignment; assignment and linked data structures; a proof of the Schorr-Waite algorithm. In: Theoretical Foundations of Programming Methodology, pp. 25\u201351. D. Reidel, Dordrecht (1982)"},{"unstructured":"Reynolds, J.C.: An overview of separation logic. In: Proceedings of Verified Software: Theories, Tools, Experiments 2005, Zurich, Switzerland, October 10-13 (2005) Revised Selected Papers and Discussions","key":"24_CR5"},{"unstructured":"Yang, H.: An example of local reasoning in BI pointer logic: The Schorr-Waite graph marking algorithm. In: Henglein, F., Hughes, J., Makholm, H., Niss, H. (eds.) SPACE 2001: Informal Proceedings of Workshop on Semantics, Program Analysis and Computing Environments for Memory Management, pp. 41\u201368. IT University of Copenhagen (2001)","key":"24_CR6"},{"issue":"5","key":"24_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF01178666","volume":"31","author":"C.B. Jones","year":"1994","unstructured":"Jones, C.B., Middelburg, C.A.: A typed logic of partial functions reconstructed classically. Acta Inform\u00a031(5), 399\u2013430 (1994)","journal-title":"Acta Inform"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-540-70592-5_17","volume-title":"ECOOP 2008 \u2013 Object-Oriented Programming","author":"A. Banerjee","year":"2008","unstructured":"Banerjee, A., Naumann, D.A., Rosenberg, S.: Regional logic for local reasoning about global invariants. In: Vitek, J. (ed.) ECOOP 2008. LNCS, vol.\u00a05142, pp. 387\u2013411. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Parkinson, M.J., Summers, A.J.: The Relationship Between Separation Logic and Implicit Dynamic Frames. Logical Methods in Computer Science\u00a08(3) (2012)","key":"24_CR9","DOI":"10.2168\/LMCS-8(3:1)2012"},{"doi-asserted-by":"crossref","unstructured":"Smans, J., Jacobs, B., Piessens, F.: Implicit dynamic frames. ACM Trans. on Programgramming Language and Systems\u00a034(1) (2012)","key":"24_CR10","DOI":"10.1145\/2160910.2160911"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39718-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:54:44Z","timestamp":1558317284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39718-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642397172","9783642397189"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39718-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}