{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:08:07Z","timestamp":1725757687382},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,1,23]]},"DOI":"10.1145\/2429069.2429085","type":"proceedings-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T15:29:29Z","timestamp":1358868569000},"page":"115-128","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Quantitative abstraction refinement"],"prefix":"10.1145","author":[{"given":"Pavol","family":"Cerny","sequence":"first","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]},{"given":"Arjun","family":"Radhakrishna","sequence":"additional","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]}],"member":"320","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"738","volume-title":"AAAI","author":"Boddy M.","year":"1991","unstructured":"M. Boddy . Anytime problem solving using dynamic programming . In AAAI , pages 738 -- 743 , 1991 . M. Boddy. Anytime problem solving using dynamic programming. In AAAI, pages 738--743, 1991."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/876638.876643"},{"key":"e_1_3_2_2_3_1","volume-title":"Numerical computation of spectral elements in max-plus algebra","author":"Cochet-Terrasson J.","year":"1998","unstructured":"J. Cochet-Terrasson , G. Cohen , S. Gaubert , M. McGettrick , and J.-P. Quadrat . Numerical computation of spectral elements in max-plus algebra , 1998 . J. Cochet-Terrasson, G. Cohen, S. Gaubert, M. McGettrick, and J.-P. Quadrat. Numerical computation of spectral elements in max-plus algebra, 1998."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11547662_8"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567778"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103687"},{"key":"e_1_3_2_2_8_1","first-page":"325","volume-title":"CAV","author":"de Alfaro L.","year":"2007","unstructured":"L. de Alfaro and P. Roy . Magnifying-lens abstraction for Markov decision processes . In CAV , pages 325 -- 338 , 2007 . L. de Alfaro and P. Roy. Magnifying-lens abstraction for Markov decision processes. In CAV, pages 325--338, 2007."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00010-6"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806630"},{"key":"e_1_3_2_2_11_1","first-page":"136","volume-title":"WCET","author":"Gustafsson J.","year":"2010","unstructured":"J. Gustafsson , A. Betts , A. Ermedahl , and B. Lisper . The m\\\"alardalen WCET benchmarks: Past, present and future . In WCET , pages 136 -- 146 , 2010 . J. Gustafsson, A. Betts, A. Ermedahl, and B. Lisper. The m\\\"alardalen WCET benchmarks: Past, present and future. In WCET, pages 136--146, 2010."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_16"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93900-9_17"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040317"},{"key":"e_1_3_2_2_15_1","volume-title":"WCET","author":"Prantl A.","year":"2008","unstructured":"A. Prantl , M. Schordan , and J. Knoop . TuBound - a conceptually new tool for worst-case execution time analysis . In WCET , 2008 . A. Prantl, M. Schordan, and J. Knoop. TuBound - a conceptually new tool for worst-case execution time analysis. In WCET, 2008."},{"key":"e_1_3_2_2_16_1","volume-title":"Usable Verification","author":"Shankar N.","year":"2010","unstructured":"N. Shankar . A tool bus for anytime verification . Usable Verification , 2010 . N. Shankar. A tool bus for anytime verification. Usable Verification, 2010."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/191326.191500"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11319-2_3"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1347375.1347389"}],"event":{"name":"POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rome Italy","acronym":"POPL '13"},"container-title":["Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2429069.2429085","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:02:16Z","timestamp":1693864936000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":19,"alternative-id":["10.1145\/2429069.2429085","10.1145\/2429069"],"URL":"https:\/\/doi.org\/10.1145\/2429069.2429085","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2480359.2429085","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,1,23]]},"assertion":[{"value":"2013-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}