{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:57:10Z","timestamp":1740095830426,"version":"3.37.3"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100004965","name":"Sixth Framework Programme","doi-asserted-by":"publisher","award":["IST-2005-015905"],"id":[{"id":"10.13039\/501100004965","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,6]]},"DOI":"10.1145\/1557898.1557904","type":"proceedings-article","created":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T17:53:09Z","timestamp":1251827589000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Strongest postcondition of unstructured programs"],"prefix":"10.1145","author":[{"given":"Radu","family":"Grigore","sequence":"first","affiliation":[{"name":"University College Dublin"}]},{"given":"Julien","family":"Charles","sequence":"additional","affiliation":[{"name":"University College Dublin"}]},{"given":"Fintan","family":"Fairmichael","sequence":"additional","affiliation":[{"name":"University College Dublin"}]},{"given":"Joseph","family":"Kiniry","sequence":"additional","affiliation":[{"name":"University College Dublin"}]}],"member":"320","published-online":{"date-parts":[[2009,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Experimental results. http:\/\/groups.google.com\/group\/freeboogie\/web\/spup-experimental-data. Experimental results. http:\/\/groups.google.com\/group\/freeboogie\/web\/spup-experimental-data."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1108792.1108813"},{"key":"e_1_3_2_1_3_1","volume-title":"The Spec# programming system: An overview. Construction and Analysis of Safe, Secure and Interoperable Smart devices, 3362","author":"Barnett M.","year":"2004","unstructured":"M. Barnett , K. R. M. Leino , and W. Schulte . The Spec# programming system: An overview. Construction and Analysis of Safe, Secure and Interoperable Smart devices, 3362 , 2004 . M. Barnett, K. R. M. Leino, and W. Schulte. The Spec# programming system: An overview. Construction and Analysis of Safe, Secure and Interoperable Smart devices, 3362, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30569-9_6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/543552.512558"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503291"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360220"},{"key":"e_1_3_2_1_8_1","unstructured":"R. Grigore. The web home of FreeBoogie. http:\/\/kind.ucd.ie\/products\/opensource\/FreeBoogie\/. R. Grigore. The web home of FreeBoogie. http:\/\/kind.ucd.ie\/products\/opensource\/FreeBoogie\/."},{"key":"e_1_3_2_1_9_1","first-page":"101","volume-title":"Proceedings of the 6th International Workshop on First-Order Theorem Proving","author":"Grigore R.","year":"2007","unstructured":"R. Grigore and M. Moskal . Edit and verify. In S. Ranise, editor , Proceedings of the 6th International Workshop on First-Order Theorem Proving , pages 101 -- 113 . University of Liverpool , Sept. 2007 . R. Grigore and M. Moskal. Edit and verify. In S. Ranise, editor, Proceedings of the 6th International Workshop on First-Order Theorem Proving, pages 101--113. University of Liverpool, Sept. 2007."},{"key":"e_1_3_2_1_10_1","volume-title":"Handbook of graph theory","author":"Gross J. L.","year":"2004","unstructured":"J. L. Gross and J. Yellen . Handbook of graph theory . CRC Press , 2004 . J. L. Gross and J. Yellen. Handbook of graph theory. CRC Press, 2004."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.8"},{"key":"e_1_3_2_1_12_1","series-title":"SIAM Journal on Computing, 2:225","volume-title":"An n 2.5 algorithm for maximum matchings in bipartite graphs","author":"Hopcroft J. E.","year":"1973","unstructured":"J. E. Hopcroft and R. M. Karp . An n 2.5 algorithm for maximum matchings in bipartite graphs . SIAM Journal on Computing, 2:225 , 1973 . J. E. Hopcroft and R. M. Karp. An n 2.5 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2:225, 1973."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/359581.359603"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Reducibility among combinatorial problems. Complexity of computer computations","author":"Karp R. M.","year":"1972","unstructured":"R. M. Karp . Reducibility among combinatorial problems. Complexity of computer computations , pages 85 -- 104 , 1972 . R. M. Karp. Reducibility among combinatorial problems. Complexity of computer computations, pages 85--104, 1972."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.10.015"},{"key":"e_1_3_2_1_16_1","volume-title":"This is Boogie 2","author":"Leino K. R. M.","year":"2008","unstructured":"K. R. M. Leino . This is Boogie 2 . 2008 . K. R. M. Leino. This is Boogie 2. 2008."},{"key":"e_1_3_2_1_17_1","unstructured":"Microsoft Research. The Boogie benchmark. http:\/\/research.microsoft.com\/en-us\/projects\/specsharp\/. Microsoft Research. The Boogie benchmark. http:\/\/research.microsoft.com\/en-us\/projects\/specsharp\/."},{"key":"e_1_3_2_1_18_1","first-page":"337","volume":"4963","author":"Moura L. D.","year":"2008","unstructured":"L. D. Moura and N. Bjorner . Z3: An efficient SMT solver. 4963 : 337 , 2008 . L. D. Moura and N. Bjorner. Z3: An efficient SMT solver. 4963:337, 2008.","journal-title":"Z3: An efficient SMT solver."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804393"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278349.1278353"}],"event":{"name":"ECOOP '09: European Conference on Object-Oriented Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Genova Italy","acronym":"ECOOP '09"},"container-title":["Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1557898.1557904","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T19:33:37Z","timestamp":1673724817000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557898.1557904"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,6]]},"references-count":20,"alternative-id":["10.1145\/1557898.1557904","10.1145\/1557898"],"URL":"https:\/\/doi.org\/10.1145\/1557898.1557904","relation":{},"subject":[],"published":{"date-parts":[[2009,7,6]]},"assertion":[{"value":"2009-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}