{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:56Z","timestamp":1772163956041,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,15]],"date-time":"2009-06-15T00:00:00Z","timestamp":1245024000000},"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":[[2009,6,15]]},"DOI":"10.1145\/1542476.1542517","type":"proceedings-article","created":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T09:34:36Z","timestamp":1245144876000},"page":"363-374","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":76,"title":["Snugglebug"],"prefix":"10.1145","author":[{"given":"Satish","family":"Chandra","sequence":"first","affiliation":[{"name":"IBM T. J. Watson Research Center, Hawthorne, NY, USA"}]},{"given":"Stephen J.","family":"Fink","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Hawthorne, NY, USA"}]},{"given":"Manu","family":"Sridharan","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Hawthorne, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792771"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368118"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503274"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_17"},{"key":"e_1_3_2_1_6_1","volume-title":"CAV","author":"Barrett C.","year":"2007","unstructured":"C. Barrett and C. Tinelli . CVC3 . In CAV , 2007 . C. Barrett and C. Tinelli. CVC3. In CAV, 2007."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390630.1390634"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(200006)30:7%3C775::AID-SPE309%3E3.0.CO;2-H"},{"key":"e_1_3_2_1_9_1","volume-title":"OSDI","author":"Cadar C.","year":"2008","unstructured":"C. Cadar , D. Dunbar , and D. Engler . KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs . In OSDI , 2008 . C. Cadar, D. Dunbar, and D. Engler. KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs. In OSDI, 2008."},{"key":"e_1_3_2_1_10_1","volume-title":"CC","author":"Cousot P.","year":"2002","unstructured":"P. Cousot and R. Cousot . Modular static program analysis . In CC , 2002 . P. Cousot and R. Cousot. Modular static program analysis. In CC, 2002."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348250.1348254"},{"key":"e_1_3_2_1_12_1","volume-title":"A Discipline of Programming","author":"Dijkstra E. W.","year":"1997","unstructured":"E. W. Dijkstra . A Discipline of Programming . Prentice Hall PTR , Upper Saddle River, NJ, USA, 1997 . E. W. Dijkstra. A Discipline of Programming. Prentice Hall PTR, Upper Saddle River, NJ, USA, 1997."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287653"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/647540.730008"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512558"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190226"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065036"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/506315.506316"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1181775.1181790"},{"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.1145\/1028664.1028717"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/347324.383378"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029894.1029907"},{"key":"e_1_3_2_1_25_1","volume-title":"MIT","author":"McCarthy J.","year":"1962","unstructured":"J. McCarthy . A basis for a mathematical theory of computation. Technical report , MIT , Cambridge, MA, USA , 1962 . J. McCarthy. A basis for a mathematical theory of computation. Technical report, MIT, Cambridge, MA, USA, 1962."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664578"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081750"},{"key":"e_1_3_2_1_29_1","first-page":"189","volume-title":"Two approaches to interprocedural data flow analysis","author":"Sharir M.","year":"1981","unstructured":"M. Sharir and A. Pnueli . Two approaches to interprocedural data flow analysis , chapter 7, pages 189 -- 233 . Prentice-Hall , 1981 . M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis, chapter 7, pages 189--233. Prentice-Hall, 1981."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025115.1025215"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007512.1007526"},{"key":"e_1_3_2_1_32_1","unstructured":"T.J. Watson Libraries for Analysis (WALA). http:\/\/wala.sf.net.  T.J. Watson Libraries for Analysis (WALA). http:\/\/wala.sf.net."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232420.1232423"}],"event":{"name":"PLDI '09: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Dublin Ireland","acronym":"PLDI '09","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1542476.1542517","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1542476.1542517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:29:49Z","timestamp":1750238989000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1542476.1542517"}},"subtitle":["a powerful approach to weakest preconditions"],"short-title":[],"issued":{"date-parts":[[2009,6,15]]},"references-count":32,"alternative-id":["10.1145\/1542476.1542517","10.1145\/1542476"],"URL":"https:\/\/doi.org\/10.1145\/1542476.1542517","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1543135.1542517","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2009,6,15]]},"assertion":[{"value":"2009-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}