{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:06:19Z","timestamp":1774987579579,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,19]],"date-time":"2012-10-19T00:00:00Z","timestamp":1350604800000},"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,10,19]]},"DOI":"10.1145\/2384616.2384656","type":"proceedings-article","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T08:07:05Z","timestamp":1350893225000},"page":"555-574","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Checking reachability using matching logic"],"prefix":"10.1145","author":[{"given":"Grigore","family":"Rosu","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign & Alexandru Ioan Cuza University, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Stefanescu","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,10,19]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"1","volume-title":"ESOP","author":"Appel A. W.","year":"2011","unstructured":"A. W. Appel . Verified software toolchain . In ESOP , volume 6602 of LNCS , pages 1 -- 17 , 2011 . A. W. Appel. Verified software toolchain. In ESOP, volume 6602 of LNCS, pages 1--17, 2011."},{"key":"e_1_3_2_1_2_1","first-page":"298","volume-title":"CAV","author":"Barrett C.","year":"2007","unstructured":"C. Barrett and C. Tinelli . CVC3 . In CAV , pages 298 -- 302 , 2007 . C. Barrett and C. Tinelli. CVC3. In CAV, pages 298--302, 2007."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90185-I"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-009-9148-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993526"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","volume-title":"All About Maude","author":"Clavel M.","year":"2007","unstructured":"M. Clavel , F. Dur\u00e1n , S. Eker , J. Meseguer , P. Lincoln , N. Mart\u00ed-Oliet , and C. Talcott . All About Maude , volume 4350 of LNCS . 2007 . M. Clavel, F. Dur\u00e1n, S. Eker, J. Meseguer, P. Lincoln, N. Mart\u00ed-Oliet, and C. Talcott. All About Maude, volume 4350 of LNCS. 2007."},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","first-page":"337","volume-title":"TACAS","author":"de Moura L. M.","year":"2008","unstructured":"L. M. de Moura and N. Bj\u00f8rner . Z3: An efficient SMT solver . In TACAS , volume 4963 of LNCS , pages 337 -- 340 , 2008 . L. M. de Moura and N. Bj\u00f8rner. Z3: An efficient SMT solver. In TACAS, volume 4963 of LNCS, pages 337--340, 2008."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11691372_19"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103719"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90014-7"},{"key":"e_1_3_2_1_12_1","volume-title":"MIT","author":"Felleisen M.","year":"2009","unstructured":"M. Felleisen , R. B. Findler , and M. Flatt . Semantics Engineer-ing with PLT Redex . MIT , 2009 . M. Felleisen, R. B. Findler, and M. Flatt. Semantics Engineer-ing with PLT Redex. MIT, 2009."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/547173"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-6259-0_10"},{"key":"e_1_3_2_1_16_1","series-title":"LNCS","first-page":"353","volume-title":"ESOP","author":"Hobor A.","year":"2008","unstructured":"A. Hobor , A. W. Appel , and F. Z. Nardelli . Oracle semantics for concurrent separation logic . In ESOP , volume 4960 of LNCS , pages 353 -- 367 , 2008 . A. Hobor, A. W. Appel, and F. Z. Nardelli. Oracle semantics for concurrent separation logic. In ESOP, volume 4960 of LNCS, pages 353--367, 2008."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEFM.2005.1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823230_17"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90182-F"},{"key":"e_1_3_2_1_20_1","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/b96103","volume-title":"CASL Reference Manual","author":"Mosses P. D.","year":"2004","unstructured":"P. D. Mosses . CASL Reference Manual , volume 2960 of LNCS . Springer , 2004 . P. D. Mosses. CASL Reference Manual, volume 2960 of LNCS. Springer, 2004."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001650050009"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/421090"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/647851.737404"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/872023.872559"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664578"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2010.03.012"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985928"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_33"},{"key":"e_1_3_2_1_29_1","volume-title":"FM, To appear","author":"Rosu G.","year":"2012","unstructured":"G. Rosu and A. Stefanescu . From Hoare logic to matching logic . In FM, To appear , 2012 . G. Rosu and A. Stefanescu. From Hoare logic to matching logic. In FM, To appear, 2012."},{"key":"e_1_3_2_1_31_1","series-title":"LNCS","first-page":"142","volume-title":"AMAST","author":"Rosu G.","year":"2010","unstructured":"G. Rosu , C. Ellison , and W. Schulte . Matching logic: An alternative to Hoare\/Floyd logic . In AMAST , volume 6486 of LNCS , pages 142 -- 162 , 2010 . G. Rosu, C. Ellison, and W. Schulte. Matching logic: An alternative to Hoare\/Floyd logic. In AMAST, volume 6486 of LNCS, pages 142--162, 2010."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/514188.514190"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/151145"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1093"}],"event":{"name":"SPLASH '12: Conference on Systems, Programming, and Applications: Software for Humanity","location":"Tucson Arizona USA","acronym":"SPLASH '12","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the ACM international conference on Object oriented programming systems languages and applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2384616.2384656","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2384616.2384656","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:21:17Z","timestamp":1750224077000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2384616.2384656"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,19]]},"references-count":32,"alternative-id":["10.1145\/2384616.2384656","10.1145\/2384616"],"URL":"https:\/\/doi.org\/10.1145\/2384616.2384656","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2398857.2384656","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,10,19]]},"assertion":[{"value":"2012-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}