{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:12:29Z","timestamp":1725577949423},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540356318"},{"type":"electronic","value":"9783540356325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11783596_10","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T14:35:02Z","timestamp":1151505302000},"page":"115-139","source":"Crossref","is-referenced-by-count":8,"title":["Compositional Reasoning for Pointer Structures"],"prefix":"10.1007","author":[{"given":"Yifeng","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. W.","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/10722010_8","volume-title":"Mathematics of Program Construction","author":"R. Bornat","year":"2000","unstructured":"Bornat, R.: Proving pointer programs in Hoare logic. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol.\u00a01837, pp. 102\u2013126. Springer, Heidelberg (2000)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45465-9_51","volume-title":"Automata, Languages and Programming","author":"L. Cardelli","year":"2002","unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: A spatial logic for querying graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 597\u2013610. Springer, Heidelberg (2002)"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/s001650200031","volume":"14","author":"Y. Chen","year":"2002","unstructured":"Chen, Y.: Generic composition. Formal Aspects of Computing\u00a014(2), 108\u2013122 (2002)","journal-title":"Formal Aspects of Computing"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Harel, D.: Dynamic logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, Extensions of Classical Logic, vol.\u00a0II, pp. 497\u2013604. D. Reidel Publ. Co. (1984)","DOI":"10.1007\/978-94-009-6259-0_10"},{"key":"10_CR5","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)"},{"key":"10_CR6","volume-title":"Unifying Theories of Programming","author":"J. He","year":"1998","unstructured":"He, J., Hoare, C.A.R.: Unifying Theories of Programming. Prentice Hall, Englewood Cliffs (1998)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48743-3_1","volume-title":"ECOOP \u201999 - Object-Oriented Programming","author":"J. He","year":"1999","unstructured":"He, J., Hoare, C.A.R.: A trace model for pointers and objects. In: Guerraoui, R. (ed.) ECOOP 1999. LNCS, vol.\u00a01628, pp. 1\u201317. Springer, Heidelberg (1999)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/360204.375719","volume-title":"Conf. Record of 28th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2001","author":"S.S. Ishtiaq","year":"2001","unstructured":"Ishtiaq, S.S., O\u2019Hearn, P.W.: BI as an assertion language for mutable data structures. In: Conf. Record of 28th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2001, pp. 14\u201326. ACM Press, New York (2001)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-540-30538-5_35","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"I. Mijajlovi\u0107","year":"2004","unstructured":"Mijajlovi\u0107, I., Torp-Smith, N., O\u2019Hearn, P.W.: Refinement and separation contexts. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 421\u2013433. Springer, Heidelberg (2004)"},{"key":"10_CR10","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"10_CR11","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)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/964001.964024","volume-title":"Proc. of 31st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2004","author":"P.W. O\u2019Hearn","year":"2004","unstructured":"O\u2019Hearn, P.W., Reynolds, J.C., Yang, H.: Separation and information hiding. In: Proc. of 31st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2004, pp. 268\u2013280. ACM Press, New York (2004)"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00165-003-0024-3","volume":"16","author":"R.F. Paige","year":"2004","unstructured":"Paige, R.F., Ostroff, J.S.: ERC\u2014an object-oriented refinement calculus for Eiffel. Formal Aspects of Computing\u00a016(1), 51\u201379 (2004)","journal-title":"Formal Aspects of Computing"},{"key":"10_CR14","first-page":"259","volume-title":"Proc. of 32nd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2005","author":"M. Parkinson","year":"2005","unstructured":"Parkinson, M., Bierman, G.: Separation logic and abstraction. In: Proc. of 32nd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2005, pp. 259\u2013270. ACM Press, New York (2005)"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/LICS.2002.1029817","volume-title":"Proc. of 17th IEEE Symp. on Logic in Computer Science, LICS 2002","author":"J.C. Reynolds","year":"2002","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: Proc. of 17th IEEE Symp. on Logic in Computer Science, LICS 2002, pp. 55\u201374. IEEE Comput. Soc. Press, Los Alamitos (2002)"},{"key":"10_CR16","unstructured":"Yang, H.: Relational separation logic. Theor. Comput. Sci. (submitted)"},{"key":"10_CR17","unstructured":"Yang, H.: Verification of the Schorr\u2013Waite graph marking algorithm by refinement. In: Workshop presentation (2003)"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11783596_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:46Z","timestamp":1605643666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11783596_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540356318","9783540356325"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11783596_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}