{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T18:35:24Z","timestamp":1757702124223,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T00:00:00Z","timestamp":1701302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1996\/18"],"award-info":[{"award-number":["1996\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Israel Science Foundation","award":["1810\/18"],"award-info":[{"award-number":["1810\/18"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,30]]},"DOI":"10.1145\/3611643.3616287","type":"proceedings-article","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T23:14:38Z","timestamp":1701386078000},"page":"1140-1152","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["State Merging with Quantifiers in Symbolic Execution"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2367-1360","authenticated-orcid":false,"given":"David","family":"Trabish","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7750-4085","authenticated-orcid":false,"given":"Noam","family":"Rinetzky","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7226-3526","authenticated-orcid":false,"given":"Sharon","family":"Shoham","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9877-8926","authenticated-orcid":false,"given":"Vaibhav","family":"Sharma","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,11,30]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2023. https:\/\/github.com\/davidtr1037\/klee-quantifiers"},{"key":"e_1_3_2_2_2_1","unstructured":"2023. https:\/\/github.com\/klee\/klee-uclibc\/pull\/47"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","unstructured":"2023. https:\/\/doi.org\/10.6084\/m9.figshare.21990386.v8 10.6084\/m9.figshare.21990386.v8","DOI":"10.6084\/m9.figshare.21990386.v8"},{"key":"e_1_3_2_2_4_1","unstructured":"2023. busybox. https:\/\/busybox.net\/"},{"key":"e_1_3_2_2_5_1","unstructured":"2023. GCov. https:\/\/gcc.gnu.org\/onlinedocs\/gcc\/Gcov.html"},{"key":"e_1_3_2_2_6_1","unstructured":"2023. GNU libtasn1. https:\/\/www.gnu.org\/software\/libtasn1\/"},{"key":"e_1_3_2_2_7_1","unstructured":"2023. GNU oSIP. https:\/\/www.gnu.org\/software\/osip\/"},{"key":"e_1_3_2_2_8_1","unstructured":"2023. GNU Wget. https:\/\/www.gnu.org\/software\/wget\/"},{"key":"e_1_3_2_2_9_1","unstructured":"2023. json-c. https:\/\/github.com\/json-c\/json-c\/"},{"key":"e_1_3_2_2_10_1","unstructured":"2023. libpng. http:\/\/www.libpng.org\/pub\/png\/libpng.html"},{"key":"e_1_3_2_2_11_1","volume-title":"Ullman","author":"Aho Alfred V.","year":"2006","unstructured":"Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman. 2006. Compilers: Principles, Techniques, and Tools (2nd ed.). Addison Wesley. isbn:0321486811"},{"key":"e_1_3_2_2_12_1","unstructured":"APR. 2023. Apache Portable Runtime."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568293"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21668-3_6"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11609773_28"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3213846.3213867"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00022"},{"key":"e_1_3_2_2_19_1","volume-title":"Proc. of the 8th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201908)","author":"Cadar Cristian","year":"2008","unstructured":"Cristian Cadar, Daniel Dunbar, and Dawson Engler. 2008. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In Proc. of the 8th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201908)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180445"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408795"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1966445.1966475"},{"volume-title":"Automated Deduction \u2013 CADE-21","author":"de Moura Leonardo","key":"e_1_3_2_2_23_1","unstructured":"Leonardo de Moura and Nikolaj Bj\u00f8rner. 2007. Efficient E-Matching for SMT Solvers. In Automated Deduction \u2013 CADE-21, Frank Pfenning (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 183\u2013198. isbn:978-3-540-73595-3"},{"volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"de Moura Leonardo","key":"e_1_3_2_2_24_1","unstructured":"Leonardo de Moura and Nikolaj Bj\u00f8rner. 2008. Z3: An Efficient SMT Solver. In Tools and Algorithms for the Construction and Analysis of Systems, C. R. Ramakrishnan and Jakob Rehof (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 337\u2013340. isbn:978-3-540-78800-3"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995376.1995394"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066100.1066102"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_49"},{"volume-title":"Proceedings of the 19th International Conference on Computer Aided Verification (CAV\u201907)","author":"Ganesh Vijay","key":"e_1_3_2_2_29_1","unstructured":"Vijay Ganesh and David L. Dill. 2007. A Decision Procedure for Bit-vectors and Arrays. In Proceedings of the 19th International Conference on Computer Aided Verification (CAV\u201907). Springer-Verlag, Berlin, Heidelberg. 519\u2013531. isbn:978-3-540-73367-6 http:\/\/dl.acm.org\/citation.cfm?id=1770351.1770421"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_25"},{"volume-title":"Proc. of the 15th Network and Distributed System Security Symposium (NDSS\u201908)","author":"Godefroid Patrice","key":"e_1_3_2_2_31_1","unstructured":"Patrice Godefroid, Michael Y. Levin, and David A. Molnar. 2008. Automated Whitebox Fuzz Testing. In Proc. of the 15th Network and Distributed System Security Symposium (NDSS\u201908)."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001424"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04694-0_6"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2012.6227168"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314610"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254088"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884807"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2013.6606623"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2016.34"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10515-013-0122-2"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89963-3_7"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Andrew Reynolds Cesare Tinelli and Leonardo De Moura. 2014. Finding conflicting instances of quantified formulas in SMT. In 2014 Formal Methods in Computer-Aided Design (FMCAD). 195\u2013202.","DOI":"10.1109\/FMCAD.2014.6987613"},{"key":"e_1_3_2_2_45_1","volume-title":"USA","author":"Reynolds Andrew","year":"2013","unstructured":"Andrew Reynolds, Cesare Tinelli, Amit Goel, Sava Krsti\u0107, Morgan Deters, and Clark Barrett. 2013. Quantifier instantiation techniques for finite model finding in SMT. In Automated Deduction\u2013CADE-24: 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013. Proceedings 24. 377\u2013391."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572299"},{"key":"e_1_3_2_2_47_1","volume-title":"36th European Conference on Object-Oriented Programming (ECOOP","author":"Schemmel Daniel","year":"2022","unstructured":"Daniel Schemmel, Julian B\u00fcning, Frank Busse, Martin Nowack, and Cristian Cadar. 2022. A Deterministic Memory Allocator for Dynamic Symbolic Execution. In 36th European Conference on Object-Oriented Programming (ECOOP 2022). 9:1\u20139:26."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786830"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3368089.3409734"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02444-8_15"},{"volume-title":"Proc. of the 16th IEEE Symposium on Logic in Computer Science (LICS\u201901)","author":"Stump Aaron","key":"e_1_3_2_2_51_1","unstructured":"Aaron Stump, Clark W. Barrett, David L. Dill, and Jeremy R. Levitt. 2001. A Decision Procedure for an Extensional Theory of Arrays. In Proc. of the 16th IEEE Symposium on Logic in Computer Science (LICS\u201901)."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3468264.3468596"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"David Trabish Noam Rinetzky Sharon Shoham and Vaibhav Sharma. 2023. State Merging with Quantifiers in Symbolic Execution. arxiv:arXiv:2308.12068.","DOI":"10.1145\/3611643.3616287"},{"key":"e_1_3_2_2_54_1","unstructured":"2022. uClibc. https:\/\/www.uclibc.org\/"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2771783.2771815"}],"event":{"name":"ESEC\/FSE '23: 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"San Francisco CA USA","acronym":"ESEC\/FSE '23"},"container-title":["Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3611643.3616287","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3611643.3616287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:03Z","timestamp":1750178163000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3611643.3616287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,30]]},"references-count":55,"alternative-id":["10.1145\/3611643.3616287","10.1145\/3611643"],"URL":"https:\/\/doi.org\/10.1145\/3611643.3616287","relation":{},"subject":[],"published":{"date-parts":[[2023,11,30]]},"assertion":[{"value":"2023-11-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}