{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T06:04:32Z","timestamp":1773727472551,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T00:00:00Z","timestamp":1535932800000},"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":[[2018,9,3]]},"DOI":"10.1145\/3238147.3238178","type":"proceedings-article","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T20:04:36Z","timestamp":1534795476000},"page":"441-451","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Client-specific equivalence checking"],"prefix":"10.1145","author":[{"given":"Federico","family":"Mora","sequence":"first","affiliation":[{"name":"University of Toronto, Canada"}]},{"given":"Yi","family":"Li","sequence":"additional","affiliation":[{"name":"University of Toronto, Canada"}]},{"given":"Julia","family":"Rubin","sequence":"additional","affiliation":[{"name":"University of British Columbia, Canada"}]},{"given":"Marsha","family":"Chechik","sequence":"additional","affiliation":[{"name":"University of Toronto, Canada"}]}],"member":"320","published-online":{"date-parts":[[2018,9,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792771"},{"key":"e_1_3_2_1_2_1","unstructured":"Springer 367\u2013381.  Springer 367\u2013381."},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. of the 2014 Marktober Summer School on Dependable Software Systems Engineering","author":"Ball Tom","unstructured":"Tom Ball and Jakub Daniel . 2015. Deconstructing Dynamic Symbolic Execution . In Proc. of the 2014 Marktober Summer School on Dependable Software Systems Engineering . IOS Press . Tom Ball and Jakub Daniel. 2015. Deconstructing Dynamic Symbolic Execution. In Proc. of the 2014 Marktober Summer School on Dependable Software Systems Engineering. IOS Press."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_17"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. of OSDI\u201908","author":"Cadar Cristian","year":"2008","unstructured":"Cristian Cadar , Daniel Dunbar , and Dawson Engler . 2008 . KLEE: Unassisted and Automatic Generation of High-Coverage Tesets for Complex Systems Programs . In Proc. of OSDI\u201908 . Cristian Cadar, Daniel Dunbar, and Dawson Engler. 2008. KLEE: Unassisted and Automatic Generation of High-Coverage Tesets for Complex Systems Programs. In Proc. of OSDI\u201908."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591062.2591104"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-008-0053-x"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41540-6_24"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2642987"},{"key":"e_1_3_2_1_10_1","unstructured":"Flint 2017. FLINT: Fast Library for Number Theory. http:\/\/www.flintlib.org.  Flint 2017. FLINT: Fast Library for Number Theory. http:\/\/www.flintlib.org."},{"key":"e_1_3_2_1_11_1","volume-title":"SMT Workshop.","author":"Gario Marco","year":"2015","unstructured":"Marco Gario and Andrea Micheli . 2015 . pySMT: a Solver-Agnostic Library for Fast Prototyping of SMT-Based Algorithms . In SMT Workshop. Marco Gario and Andrea Micheli. 2015. pySMT: a Solver-Agnostic Library for Fast Prototyping of SMT-Based Algorithms. In SMT Workshop."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190226"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2041552.2041564"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1472"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38574-2_20"},{"key":"e_1_3_2_1_16_1","unstructured":"Ming Kawaguchi Shuvendu Lahiri and Henrique Rebelo. 2010. Conditional Equivalence. Technical Report. Microsoft Research.  Ming Kawaguchi Shuvendu Lahiri and Henrique Rebelo. 2010. Conditional Equivalence. Technical Report. Microsoft Research."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_54"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491452"},{"key":"e_1_3_2_1_20_1","unstructured":"MPACK 2017. The MPACK: Multiple Precision Arithmetic BLAS (MBLAS) and LAPACK (MLAPACK). http:\/\/mplapack.sourceforge.net.  MPACK 2017. The MPACK: Multiple Precision Arithmetic BLAS (MBLAS) and LAPACK (MLAPACK). http:\/\/mplapack.sourceforge.net."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453101.1453131"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993558"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884871"},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. of FMCAD\u201912","author":"Sery Ondrej","year":"2012","unstructured":"Ondrej Sery , Grigory Fedyukovich , and Natasha Sharygina . 2012 . Incremental Upgrade Checking by Means of Interpolation-Based Function Summaries . In Proc. of FMCAD\u201912 . IEEE, 114\u2013121. Ondrej Sery, Grigory Fedyukovich, and Natasha Sharygina. 2012. Incremental Upgrade Checking by Means of Interpolation-Based Function Summaries. In Proc. of FMCAD\u201912. IEEE, 114\u2013121."}],"event":{"name":"ASE '18: 33rd ACM\/IEEE International Conference on Automated Software Engineering","location":"Montpellier France","acronym":"ASE '18","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","CNRS Centre National De La Rechercue Scientifique","SIGSOFT ACM Special Interest Group on Software Engineering","IEEE-CS Computer Society"]},"container-title":["Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3238147.3238178","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3238147.3238178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:35Z","timestamp":1750210775000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3238147.3238178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,3]]},"references-count":25,"alternative-id":["10.1145\/3238147.3238178","10.1145\/3238147"],"URL":"https:\/\/doi.org\/10.1145\/3238147.3238178","relation":{},"subject":[],"published":{"date-parts":[[2018,9,3]]},"assertion":[{"value":"2018-09-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}