{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:09:32Z","timestamp":1774987772355,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"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":[[2011,6,4]]},"DOI":"10.1145\/1993498.1993504","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T07:53:52Z","timestamp":1307346832000},"page":"38-49","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["Data representation synthesis"],"prefix":"10.1145","author":[{"given":"Peter","family":"Hawkins","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Alex","family":"Aiken","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Kathleen","family":"Fisher","sequence":"additional","affiliation":[{"name":"Tufts University, Medford, MA, USA"}]},{"given":"Martin","family":"Rinard","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"IEEE Computer Society","author":"Ahmed Nawaaz","year":"2000","unstructured":"Nawaaz Ahmed , Nikolay Mateev , Keshav Pingali , and Paul Stodghill . A framework for sparse matrix code synthesis from high-level specifications. In Supercomputing, page 58 . IEEE Computer Society , November 2000 . doi: 10.1109\/SC.2000.10033. 10.1109\/SC.2000.10033 Nawaaz Ahmed, Nikolay Mateev, Keshav Pingali, and Paul Stodghill. A framework for sparse matrix code synthesis from high-level specifications. In Supercomputing, page 58. IEEE Computer Society, November 2000. doi: 10.1109\/SC.2000.10033."},{"key":"e_1_3_2_1_2_1","series-title":"LNCS","first-page":"178","volume-title":"CAV","author":"Berdine Josh","year":"2007","unstructured":"Josh Berdine , Cristiano Calgano , Byron Cook , Dino Distefano , Peter W. O'Hearn , Thomas Wies , and Hongseok Yang . Shape analysis for composite data structures . In CAV , volume 4590 of LNCS , pages 178 -- 192 . Springer Berlin \/ Heidelberg , 2007 . doi: 10.1007\/ 978-3-540-73368-3 22. Josh Berdine, Cristiano Calgano, Byron Cook, Dino Distefano, Peter W. O'Hearn, Thomas Wies, and Hongseok Yang. Shape analysis for composite data structures. In CAV, volume 4590 of LNCS, pages 178--192. Springer Berlin \/ Heidelberg, 2007. doi: 10.1007\/ 978-3-540-73368-3 22."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11531142_12"},{"key":"e_1_3_2_1_4_1","unstructured":"Boost. Boost C++ libraries 2010. URL http:\/\/www.boost.org\/.  Boost. Boost C++ libraries 2010. URL http:\/\/www.boost.org\/."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/99583.99605"},{"key":"e_1_3_2_1_6_1","first-page":"146","volume-title":"VLDB","author":"Chaudhuri Surajit","year":"1997","unstructured":"Surajit Chaudhuri and Vivek R. Narasayya . An efficient cost-driven index selection tool for Microsoft SQL Server . In VLDB , pages 146 -- 155 , San Francisco, CA , USA, 1997 . Morgan Kaufmann Publishers . ISBN 1-55860-470-7. Surajit Chaudhuri and Vivek R. Narasayya. An efficient cost-driven index selection tool for Microsoft SQL Server. In VLDB, pages 146--155, San Francisco, CA, USA, 1997. Morgan Kaufmann Publishers. ISBN 1-55860-470-7."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596565"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/52.210604"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/357062.357064"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449782"},{"key":"e_1_3_2_1_11_1","volume-title":"International Workshop on Alias Confinement and Ownership","author":"F\u00e4hndrich Manuel","year":"2003","unstructured":"Manuel F\u00e4hndrich and K. Rustan M. Leino . Heap monotonic typestates . In International Workshop on Alias Confinement and Ownership , July 2003 . Manuel F\u00e4hndrich and K. Rustan M. Leino. Heap monotonic typestates. In International Workshop on Alias Confinement and Ownership, July 2003."},{"key":"e_1_3_2_1_12_1","series-title":"LNCS","first-page":"204","volume-title":"APLAS","author":"Hawkins Peter","year":"2010","unstructured":"Peter Hawkins , Alex Aiken , Kathleen Fisher , Martin Rinard , and Mooly Sagiv . Data structure fusion . In APLAS , volume 6461 of LNCS , pages 204 -- 221 . Springer Berlin \/ Heidelberg , 2010 . doi: 10.1007\/978-3-642-17164-2 15. 10.1007\/978-3-642-17164-2 Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin Rinard, and Mooly Sagiv. Data structure fusion. In APLAS, volume 6461 of LNCS, pages 204--221. Springer Berlin \/ Heidelberg, 2010. doi: 10.1007\/978-3-642-17164-2 15."},{"key":"e_1_3_2_1_13_1","volume-title":"International Workshop on Foundations of Object-Oriented Languages (FOOL)","author":"Juhasz Uri","year":"2009","unstructured":"Uri Juhasz , Noam Rinetzk , Arnd Poetzsch-Heffter , Mooly Sagiv , and Eran Yahav . Modular verification with shared abstractions . In International Workshop on Foundations of Object-Oriented Languages (FOOL) , 2009 . Uri Juhasz, Noam Rinetzk, Arnd Poetzsch-Heffter, Mooly Sagiv, and Eran Yahav. Modular verification with shared abstractions. In International Workshop on Foundations of Object-Oriented Languages (FOOL), 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158628"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646662.699553"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11319-2_17"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.125"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503276"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_28"},{"key":"e_1_3_2_1_20_1","volume-title":"LNCS","author":"Lee Oukseh","year":"2011","unstructured":"Oukseh Lee , Hongseok Yang , and Rasmus Petersen . Program analysis for overlaid data structures. In CAV , LNCS , 2011 . To appear. Oukseh Lee, Hongseok Yang, and Rasmus Petersen. Program analysis for overlaid data structures. In CAV, LNCS, 2011. To appear."},{"key":"e_1_3_2_1_21_1","series-title":"LNCS","first-page":"71","volume-title":"Static Analysis","author":"McCloskey Bill","year":"2011","unstructured":"Bill McCloskey , Thomas Reps , and Mooly Sagiv . Statically inferring complex heap, array, and numeric invariants . In Static Analysis , volume 6337 of LNCS , pages 71 -- 99 . Springer Berlin \/ Heidelberg , 2011 . doi: 10.1007\/978-3-642-15769-1 6. 10.1007\/978-3-642-15769-1 Bill McCloskey, Thomas Reps, and Mooly Sagiv. Statically inferring complex heap, array, and numeric invariants. In Static Analysis, volume 6337 of LNCS, pages 71--99. Springer Berlin \/ Heidelberg, 2011. doi: 10.1007\/978-3-642-15769-1 6."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142552"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(87)80066-4"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664578"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244381.1244394"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567771"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542522"},{"key":"e_1_3_2_1_29_1","first-page":"257","volume-title":"Conference on Domain-Specific Languages (DSL '97)","author":"Smaragdakis Yannis","year":"1997","unstructured":"Yannis Smaragdakis and Don Batory . DiSTiL : a transformation library for data structures . In Conference on Domain-Specific Languages (DSL '97) , pages 257 -- 271 . USENIX, October 1997 . Yannis Smaragdakis and Don Batory. DiSTiL: a transformation library for data structures. In Conference on Domain-Specific Languages (DSL '97), pages 257--271. USENIX, October 1997."},{"key":"e_1_3_2_1_30_1","series-title":"LNCS","first-page":"54","volume-title":"ECOOP","author":"Vaziri Mandana","year":"2007","unstructured":"Mandana Vaziri , Frank Tip , Stephen Fink , and Julian Dolby . Declarative object identity using relation types . In ECOOP , volume 4609 of LNCS , pages 54 -- 78 . Springer Berlin \/ Heidelberg , 2007 . doi: 10.1007\/978-3-540-73589-2 4. 10.1007\/978-3-540-73589-2 Mandana Vaziri, Frank Tip, Stephen Fink, and Julian Dolby. Declarative object identity using relation types. In ECOOP, volume 4609 of LNCS, pages 54--78. Springer Berlin \/ Heidelberg, 2007. doi: 10.1007\/978-3-540-73589-2 4."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375624"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542514"}],"event":{"name":"PLDI '11: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"San Jose California USA","acronym":"PLDI '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993498.1993504","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993498.1993504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:05:46Z","timestamp":1750230346000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993498.1993504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":32,"alternative-id":["10.1145\/1993498.1993504","10.1145\/1993498"],"URL":"https:\/\/doi.org\/10.1145\/1993498.1993504","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1993316.1993504","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}