{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T01:05:31Z","timestamp":1784768731498,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"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,6,5]]},"DOI":"10.1145\/1806596.1806630","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T08:37:34Z","timestamp":1275986254000},"page":"292-304","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["The reachability-bound problem"],"prefix":"10.1145","author":[{"given":"Sumit","family":"Gulwani","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Zuleger","sequence":"additional","affiliation":[{"name":"TU Vienna, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Z3 Theorem Prover. research.microsoft.com\/projects\/Z3\/.  Z3 Theorem Prover. research.microsoft.com\/projects\/Z3\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69166-2_15"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_12"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190249"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250769"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706308"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134029"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/325694.325716"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287681"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_41"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2391451.2391475"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_35"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542518"},{"key":"e_1_3_2_1_17_1","unstructured":"S. Gulwani and S. Juvekar. Bound analysis using backward symbolic execution. Technical report Oct 2009.  S. Gulwani and S. Juvekar. Bound analysis using backward symbolic execution. Technical report Oct 2009."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480912"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480898"},{"key":"e_1_3_2_1_20_1","first-page":"200","volume-title":"SAS","author":"Handjieva M.","year":"1998"},{"key":"e_1_3_2_1_21_1","volume-title":"Ist Workshop on Quantitative Analysis of Software. http:\/\/research.microsoft.com\/users\/sumitg\/qa09\/keynote.pdf","author":"Henzinger T.","year":"2009"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706327"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190251"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2001.957836"},{"key":"e_1_3_2_1_25_1","volume-title":"Morgan Kaufmann","author":"Muchnick S. S.","year":"1997"},{"key":"e_1_3_2_1_26_1","unstructured":"Microsoft Phoenix Compiler research.microsoft.com\/phoenix\/.  Microsoft Phoenix Compiler research.microsoft.com\/phoenix\/."},{"key":"e_1_3_2_1_27_1","volume-title":"VMCAI'04","author":"Podelski A."},{"key":"e_1_3_2_1_28_1","volume-title":"LICS '04","author":"Podelski A."},{"key":"e_1_3_2_1_29_1","first-page":"331","volume-title":"ASIAN","author":"Popeea C.","year":"2006"},{"key":"e_1_3_2_1_30_1","volume-title":"CoRR","author":"Prantl A.","year":"2009"},{"key":"e_1_3_2_1_31_1","volume-title":"Inc.","author":"Warren H. S.","year":"2002"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1347375.1347389"}],"event":{"name":"PLDI '10: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Toronto Ontario Canada","acronym":"PLDI '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806596.1806630","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806596.1806630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:22:31Z","timestamp":1750231351000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806596.1806630"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":32,"alternative-id":["10.1145\/1806596.1806630","10.1145\/1806596"],"URL":"https:\/\/doi.org\/10.1145\/1806596.1806630","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1809028.1806630","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}