{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:12Z","timestamp":1772163972600,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,1,11]],"date-time":"2006-01-11T00:00:00Z","timestamp":1136937600000},"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":[[2006,1,11]]},"DOI":"10.1145\/1111037.1111048","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T10:52:40Z","timestamp":1139223160000},"page":"115-126","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":50,"title":["Verifying properties of well-founded linked lists"],"prefix":"10.1145","author":[{"given":"Shuvendu K.","family":"Lahiri","sequence":"first","affiliation":[{"name":"Microsoft Research"}]},{"given":"Shaz","family":"Qadeer","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]}],"member":"320","published-online":{"date-parts":[[2006,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28644-8_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_12"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378846"},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/978-3-540-27813-9_49","volume-title":"Computer Aided Verification (CAV'04)","author":"Barrett C.","year":"2004"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645393.651895"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"97","volume-title":"FSTTCS 04: Foundations of Software Technology and Theoretical Computer Science","author":"Berdine J.","year":"2004"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647771.734437"},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/3-540-36384-X_25","volume-title":"VMCAI 03: Verification, Model checking, and Abstract Interpretation","author":"Dams D.","year":"2003"},{"key":"e_1_3_2_1_9_1","unstructured":"D. L. Detlefs G. Nelson and J. B. Saxe. Simplify: A theorem prover for program checking. Technical report HPL-2003-148 2003.]]  D. L. Detlefs G. Nelson and J. B. Saxe. Simplify: A theorem prover for program checking. Technical report HPL-2003-148 2003.]]"},{"key":"e_1_3_2_1_10_1","volume-title":"Prentice-Hall","author":"Dijkstra E.W.","year":"1976"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1102"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512558"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503291"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237724"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/647766.733618"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040331"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503279"},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/978-3-540-30124-0_15","volume-title":"CSL 04: Computer Science Logic","author":"Immerman N.","year":"2004"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.375719"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158628"},{"key":"e_1_3_2_1_21_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-3-540-24622-0_22","volume-title":"VMCAI 04: Verification, Model Checking and Abstract Interpretation","author":"Lahiri S. K.","year":"2004"},{"key":"e_1_3_2_1_22_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-540-27813-9_11","volume-title":"Computer Aided Verification (CAV'04)","author":"Lahiri S. K.","year":"2004"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11532231_8"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/647169.718161"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_13"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_47"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378851"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/357073.357079"},{"key":"e_1_3_2_1_31_1","unstructured":"G. Nelson and F. F. Yao. Solving reachability constraints for linear lists 1982. Unpublished manuscript.]]  G. Nelson and F. F. Yao. Solving reachability constraints for linear lists 1982. Unpublished manuscript.]]"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/567067.567073"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/647851.737404"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964024"},{"key":"e_1_3_2_1_35_1","unstructured":"S. Ranise and C. Zarba. A decidable logic for pointer programs manipulating linked lists 2004. Unpublished manuscript.]]  S. Ranise and C. Zarba. A decidable logic for pointer programs manipulating linked lists 2004. Unpublished manuscript.]]"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36575-3_26"},{"key":"e_1_3_2_1_37_1","first-page":"55","volume-title":"LICS 02: Logic in Computer Science","author":"Reynolds J. C.","year":"2002"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/271510.271517"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292552"}],"event":{"name":"POPL06: The 33rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2006","location":"Charleston South Carolina USA","acronym":"POPL06","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111037.1111048","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1111037.1111048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:38:28Z","timestamp":1750268308000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111037.1111048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1,11]]},"references-count":38,"alternative-id":["10.1145\/1111037.1111048","10.1145\/1111037"],"URL":"https:\/\/doi.org\/10.1145\/1111037.1111048","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1111320.1111048","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2006,1,11]]},"assertion":[{"value":"2006-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}