{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:19:33Z","timestamp":1781075973392,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T00:00:00Z","timestamp":1358899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,1,23]]},"DOI":"10.1145\/2429069.2429131","type":"proceedings-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T10:29:29Z","timestamp":1358850569000},"page":"523-536","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["The ramifications of sharing in data structures"],"prefix":"10.1145","author":[{"given":"Aquinas","family":"Hobor","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jules","family":"Villard","sequence":"additional","affiliation":[{"name":"University College London, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"SPACE","author":"Bornat R.","year":"2004","unstructured":"R. Bornat , C. Calcagno , and P. O'Hearn . Local reasoning, separation and aliasing . In SPACE , 2004 . R. Bornat, C. Calcagno, and P. O'Hearn. Local reasoning, separation and aliasing. In SPACE, 2004."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.11.059"},{"key":"e_1_3_2_2_3_1","volume-title":"MPC","author":"Bornat R.","year":"2000","unstructured":"R. Bornat . Proving pointer programs in Hoare logic . In MPC , 2000 . R. Bornat. Proving pointer programs in Hoare logic. In MPC, 2000."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529402"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/362790.362798"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.30"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10672-9_13"},{"key":"e_1_3_2_2_9_1","volume-title":"ICFEM","author":"Gast H.","year":"2011","unstructured":"H. Gast . Developer-oriented correctness proofs - a case study of Cheney's algorithm . In ICFEM , 2011 . H. Gast. Developer-oriented correctness proofs - a case study of Cheney's algorithm. In ICFEM, 2011."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103663"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792878.1792914"},{"key":"e_1_3_2_2_12_1","volume-title":"ENTCS","author":"Hobor A.","year":"2010","unstructured":"A. Hobor , R. Dockins , and A. W. Appel . A logical mix of approximation and separation. In APLAS , ENTCS , 2010 . A. Hobor, R. Dockins, and A. W. Appel. A logical mix of approximation and separation. In APLAS, ENTCS, 2010."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480935"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.375719"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1708016.1708025"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1939141.1939161"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73564"},{"key":"e_1_3_2_2_18_1","volume-title":"CAV","author":"Lee O.","year":"2011","unstructured":"O. Lee , H. Yang , and R. Petersen . Program analysis for overlaid data structures . In CAV , 2011 . O. Lee, H. Yang, and R. Petersen. Program analysis for overlaid data structures. In CAV, 2011."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11901433_22"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.10.007"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27705-4_15"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27864-1_20"},{"key":"e_1_3_2_2_23_1","volume-title":"Millennial Perspectives in Computer Science","author":"Reynolds J. C.","year":"2000","unstructured":"J. C. Reynolds . Intuitionistic reasoning about shared mutable data structure . In Millennial Perspectives in Computer Science , Cornerstones of Computing , 2000 . J. C. Reynolds. Intuitionistic reasoning about shared mutable data structure. In Millennial Perspectives in Computer Science, Cornerstones of Computing, 2000."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664578"},{"key":"e_1_3_2_2_25_1","volume-title":"http:\/\/www.cs.cmu.edu\/afs\/cs.cmu.edu\/project\/fox-19\/member\/jcr\/wwwaac2003\/notes7.ps","author":"Reynolds J. C.","year":"2003","unstructured":"J. C. Reynolds . A short course on separation logic. http:\/\/www.cs.cmu.edu\/afs\/cs.cmu.edu\/project\/fox-19\/member\/jcr\/wwwaac2003\/notes7.ps , 2003 . J. C. Reynolds. A short course on separation logic. http:\/\/www.cs.cmu.edu\/afs\/cs.cmu.edu\/project\/fox-19\/member\/jcr\/wwwaac2003\/notes7.ps, 2003."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00131-X"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377492.1377499"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/2272559"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392200.2392220"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11609773_11"}],"event":{"name":"POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Rome Italy","acronym":"POPL '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429131","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2429069.2429131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:35Z","timestamp":1750221335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":29,"alternative-id":["10.1145\/2429069.2429131","10.1145\/2429069"],"URL":"https:\/\/doi.org\/10.1145\/2429069.2429131","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2480359.2429131","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,1,23]]},"assertion":[{"value":"2013-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}