{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:49:15Z","timestamp":1775868555715,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,1,17]],"date-time":"2010-01-17T00:00:00Z","timestamp":1263686400000},"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":[[2010,1,17]]},"DOI":"10.1145\/1706299.1706326","type":"proceedings-article","created":{"date-parts":[[2010,1,19]],"date-time":"2010-01-19T15:15:04Z","timestamp":1263914104000},"page":"211-222","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["Automatic numeric abstractions for heap-manipulating programs"],"prefix":"10.1145","author":[{"given":"Stephen","family":"Magill","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Ming-Hsien","family":"Tsai","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan Roc"}]},{"given":"Peter","family":"Lee","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Yih-Kuen","family":"Tsay","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan Roc"}]}],"member":"320","published-online":{"date-parts":[[2010,1,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378846"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964003"},{"key":"e_1_3_2_1_3_1","first-page":"178","volume-title":"CAV, LNCS 4590","author":"Berdine J.","year":"2007","unstructured":"J. Berdine , C. Calcagno , B. Cook , D. Distefano , P. W. O'Hearn , T. Wies , and H. Yang . Shape analysis for composite data structures . In CAV, LNCS 4590 , pages 178 -- 192 . Springer , 2007 . J. Berdine, C. Calcagno, B. Cook, D. Distefano, P. W. O'Hearn, T. Wies, and H. Yang. Shape analysis for composite data structures. In CAV, LNCS 4590, pages 178--192. Springer, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_35"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_48"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_47"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328453"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90098-9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480917"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823230_13"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328469"},{"key":"e_1_3_2_1_12_1","first-page":"384","volume-title":"SAS, LNCS 4634","author":"Chang B.-Y. E.","year":"2007","unstructured":"B.-Y. E. Chang , X. Rival , and G. C. Necula . Shape analysis with structural invariant checkers . In SAS, LNCS 4634 , pages 384 -- 401 . Springer , 2007 . B.-Y. E. Chang, X. Rival, and G. C. Necula. Shape analysis with structural invariant checkers. In SAS, LNCS 4634, pages 384--401. Springer, 2007."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2009.5351120"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134029"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11691372_19"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449782"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480898"},{"key":"e_1_3_2_1_19_1","first-page":"145","volume":"4762","author":"Habermehl P.","year":"2007","unstructured":"P. Habermehl , R. Iosif , A. Rogalewicz , and T. Vojnar . Proving termination of tree manipulating programs. In ATVA, LNCS 4762 , pages 145 -- 161 . Springer, 2007 . P. Habermehl, R. Iosif, A. Rogalewicz, and T. Vojnar. Proving termination of tree manipulating programs. In ATVA, LNCS 4762, pages 145--161. Springer, 2007.","journal-title":"Proving termination of tree manipulating programs. In ATVA, LNCS"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503279"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823230_17"},{"key":"e_1_3_2_1_22_1","first-page":"419","volume":"4634","author":"Magill S.","year":"2007","unstructured":"S. Magill , J. Berdine , E. M. Clarke , and B. Cook . Arithmetic strengthening for shape analysis. In SAS, LNCS 4634 , pages 419 -- 436 . Springer, 2007 . S. Magill, J. Berdine, E. M. Clarke, and B. Cook. Arithmetic strengthening for shape analysis. In SAS, LNCS 4634, pages 419--436. Springer, 2007.","journal-title":"Arithmetic strengthening for shape analysis. In SAS, LNCS"},{"key":"e_1_3_2_1_23_1","volume-title":"SPACE","author":"Magill S.","year":"2006","unstructured":"S. Magill , A. Nanevski , and E. M. Clarke . Inferring invariants in separation logic for imperative list-processing programs . In SPACE , 2006 . S. Magill, A. Nanevski, and E. M. Clarke. Inferring invariants in separation logic for imperative list-processing programs. In SPACE, 2006."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_41"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763048.1763074"},{"key":"e_1_3_2_1_27_1","volume-title":"An axiomatic proof technique for parallel programs I. Acta Informatica, 6: 319--340","author":"Owicki S. S.","year":"1976","unstructured":"S. S. Owicki and D. Gries . An axiomatic proof technique for parallel programs I. Acta Informatica, 6: 319--340 , 1976 . S. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6:319--340, 1976."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018438.1021840"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69611-7_16"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_31"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27864-1_18"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/362575.362577"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.12.036"}],"event":{"name":"POPL '10: The 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Madrid Spain","acronym":"POPL '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1706299.1706326","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1706299.1706326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:26:19Z","timestamp":1750263979000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1706299.1706326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,17]]},"references-count":32,"alternative-id":["10.1145\/1706299.1706326","10.1145\/1706299"],"URL":"https:\/\/doi.org\/10.1145\/1706299.1706326","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1707801.1706326","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,1,17]]},"assertion":[{"value":"2010-01-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}