{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:35:06Z","timestamp":1770280506629,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,31]],"date-time":"2012-03-31T00:00:00Z","timestamp":1333152000000},"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":[[2012,3,31]]},"DOI":"10.1145\/2259016.2259049","type":"proceedings-article","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T13:03:31Z","timestamp":1339419811000},"page":"252-263","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient bottom-up heap analysis for symbolic path-based data access summaries"],"prefix":"10.1145","author":[{"given":"Ivan","family":"Matosevic","sequence":"first","affiliation":[{"name":"University of Toronto, Toronto, Ontario, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tarek S.","family":"Abdelrahman","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, Ontario, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,3,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1770351.1770381"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640097"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645988.674177"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480917"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646542.696202"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:SUPE.0000014804.20789.21"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328469"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349311"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/381788.316171"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/320384.320386"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.1264798"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of Workshop on Formal Techniques for Java-like Programs (FTfJP)","author":"Cunningham D.","year":"2008","unstructured":"D. Cunningham , S. Drossopoulou , and S. Eisenbach . Lock inference proven correct . In Proc. of Workshop on Formal Techniques for Java-like Programs (FTfJP) , 2008 . D. Cunningham, S. Drossopoulou, and S. Eisenbach. Lock inference proven correct. In Proc. of Workshop on Formal Techniques for Java-like Programs (FTfJP), 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788374.1788399"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178263"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993565"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237724"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03237-0_14"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/379605.379665"},{"key":"e_1_3_2_1_19_1","first-page":"131","volume-title":"Proc. of Workshop on Languages and Compilers for Parallel Computing (LCPC)","author":"Hwang Y.-S.","year":"1997","unstructured":"Y.-S. Hwang and J. H. Saltz . Identifying def\/use information of statements that construct and traverse dynamic recursive data structures . In Proc. of Workshop on Languages and Compilers for Parallel Computing (LCPC) , pages 131 -- 145 , 1997 . Y.-S. Hwang and J. H. Saltz. Identifying def\/use information of statements that construct and traverse dynamic recursive data structures. In Proc. of Workshop on Languages and Compilers for Parallel Computing (LCPC), pages 131--145, 1997."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2008.11.003"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290520.1290521"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250766"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69166-2_24"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788374.1788396"},{"key":"e_1_3_2_1_25_1","volume-title":"Morgan Kaufmann","author":"Muchnick S. S.","year":"1997","unstructured":"S. S. Muchnick . Advanced compiler design and implementation . Morgan Kaufmann , 1997 . S. S. Muchnick. Advanced compiler design and implementation. Morgan Kaufmann, 1997."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706330"},{"key":"e_1_3_2_1_27_1","first-page":"12","volume-title":"The Compiler Design Handbook","author":"Reps T. W.","year":"2008","unstructured":"T. W. Reps , M. Sagiv , and R. Wilhelm . Shape analysis and applications . In Y. N. Srikant and P. Shankar, editors, The Compiler Design Handbook , pages 12 - 11 --12-44. CRC Press , 2008 . T. W. Reps, M. Sagiv, and R. Wilhelm. Shape analysis and applications. In Y. N. Srikant and P. Shankar, editors, The Compiler Design Handbook, pages 12-1--12-44. CRC Press, 2008."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11547662_20"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1057387.1057388"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/514188.514190"},{"key":"e_1_3_2_1_31_1","first-page":"16","volume-title":"Proc. of Workshop on Heap Analysis and Verification (HAV)","author":"Wies T.","year":"2007","unstructured":"T. Wies , V. Kuncak , K. Zee , A. Podelski , and M. Rinard . Verifying complex properties using symbolic shape analysis . In Proc. of Workshop on Heap Analysis and Verification (HAV) , pages 16 -- 34 , 2007 . T. Wies, V. Kuncak, K. Zee, A. Podelski, and M. Rinard. Verifying complex properties using symbolic shape analysis. In Proc. of Workshop on Heap Analysis and Verification (HAV), pages 16--34, 2007."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772985"}],"event":{"name":"CGO '12: Annual IEEE\/ACM International Symposium on Code Generation and Optimization","location":"San Jose California","acronym":"CGO '12","sponsor":["IEEE CS uArch","SIGPLAN ACM Special Interest Group on Programming Languages","SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the Tenth International Symposium on Code Generation and Optimization"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2259016.2259049","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2259016.2259049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:07Z","timestamp":1750236547000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2259016.2259049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,31]]},"references-count":32,"alternative-id":["10.1145\/2259016.2259049","10.1145\/2259016"],"URL":"https:\/\/doi.org\/10.1145\/2259016.2259049","relation":{},"subject":[],"published":{"date-parts":[[2012,3,31]]},"assertion":[{"value":"2012-03-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}