{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T10:22:29Z","timestamp":1768904549987,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"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":[[2022,10,10]]},"DOI":"10.1145\/3551349.3560435","type":"proceedings-article","created":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T20:43:54Z","timestamp":1672951434000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Finding and Understanding Incompleteness Bugs in SMT Solvers"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4122-5981","authenticated-orcid":false,"given":"Mauro","family":"Bringolf","sequence":"first","affiliation":[{"name":"ETH Zurich, Switzerland"}]},{"given":"Dominik","family":"Winterer","sequence":"additional","affiliation":[{"name":"Computer Science, ETH Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2970-1391","authenticated-orcid":false,"given":"Zhendong","family":"Su","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2023,1,5]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"AdaCore. 2022. SPARK. Retrieved 2022-09-07 from https:\/\/github.com\/AdaCore\/spark2014"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"John Backes Pauline Bolignano Byron Cook Catherine Dodge Andrew Gacek Kasper\u00a0S\u00f8e Luckow Neha Rungta Oksana Tkachuk and Carsten Varming. 2018. Semantic-based Automated Reasoning for AWS Access Policies using SMT. In FMCAD \u201918. 1\u20139.","DOI":"10.23919\/FMCAD.2018.8602994"},{"key":"e_1_3_2_1_3_1","unstructured":"Clark Barrett Pascal Fontaine and Cesare Tinelli. 2019. The Satisfiability Modulo Theories Library (SMT-LIB). Retrieved 2022-08-09 from www.SMT-LIB.org"},{"key":"e_1_3_2_1_4_1","unstructured":"Clark Barrett Aaron Stump and Cesare Tinelli. 2010. The SMT-LIB Standard: Version 2.0. In SMT \u201910."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Dmitry Blotsky Federico Mora Murphy Berzish Yunhui Zheng Ifaz Kabir and Vijay Ganesh. 2018. StringFuzz: A Fuzzer for String Solvers. In CAV \u201918. 45\u201351.","DOI":"10.1007\/978-3-319-96142-2_6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Alexandra Bugariu and Peter M\u00fcller. 2020. Automatically Testing String Solvers. In ICSE \u201920. 1459\u20131470.","DOI":"10.1145\/3377811.3380398"},{"key":"e_1_3_2_1_7_1","volume-title":"KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In OSDI \u201908. 209\u2013224.","author":"Cadar Cristian","year":"2008","unstructured":"Cristian Cadar, Daniel Dunbar, and Dawson\u00a0R. Engler. 2008. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In OSDI \u201908. 209\u2013224."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Leonardo de Moura and Nikolaj Bj\u00f8rner. 2008. Z3: An Efficient SMT Solver. In TACAS \u201908. 337\u2013340.","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_2_1_9_1","unstructured":"Rob DeLine and Rustan Leino. 2005. BoogiePL: A Typed Procedural Language for Checking Object-Oriented Programs. Technical Report."},{"key":"e_1_3_2_1_10_1","volume-title":"Simplify: A Theorem Prover for Program Checking. JACM","author":"Detlefs David","year":"2005","unstructured":"David Detlefs, Greg Nelson, and James\u00a0B. Saxe. 2005. Simplify: A Theorem Prover for Program Checking. JACM (2005), 365\u2013473."},{"key":"e_1_3_2_1_11_1","volume-title":"SBV: SMT Based Verification in Haskell. Retrieved 2022-09-07 from https:\/\/github.com\/LeventErkok\/sbv","author":"Erkok Levent","year":"2022","unstructured":"Levent Erkok. 2022. SBV: SMT Based Verification in Haskell. Retrieved 2022-09-07 from https:\/\/github.com\/LeventErkok\/sbv"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Patrice Godefroid Nils Klarlund and Koushik Sen. 2005. DART: directed automated random testing. In PLDI \u201905. 213\u2013223.","DOI":"10.1145\/1065010.1065036"},{"key":"e_1_3_2_1_13_1","volume-title":"SAGE: Whitebox Fuzzing for Security Testing: SAGE Has Had a Remarkable Impact at Microsoft.Queue","author":"Godefroid Patrice","year":"2012","unstructured":"Patrice Godefroid, Michael\u00a0Y. Levin, and David Molnar. 2012. SAGE: Whitebox Fuzzing for Security Testing: SAGE Has Had a Remarkable Impact at Microsoft.Queue (2012), 20\u201327."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Andrei Lascu Alastair\u00a0F. Donaldson Tobias Grosser and Torsten Hoefler. 2022. Metamorphic Fuzzing of C++ Libraries. In ICST \u201922. 35\u201346.","DOI":"10.1109\/ICST53961.2022.00015"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Caroline Lemieux Rohan Padhye Koushik Sen and Dawn Song. 2018. PerfFuzz: Automatically Generating Pathological Inputs. In ISSTA \u201918. 254\u2013265.","DOI":"10.1145\/3213846.3213874"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Nuno\u00a0P Lopes David Menendez Santosh Nagarakatte and John Regehr. 2015. Provably correct peephole optimizations with alive. PLDI \u201915 22\u201332.","DOI":"10.1145\/2737924.2737965"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Muhammad\u00a0Numair Mansur Maria Christakis Valentin W\u00fcstholz and Fuyuan Zhang. 2020. Detecting Critical Bugs in SMT Solvers Using Blackbox Mutational Fuzzing. In FSE \u201920. 701\u2013712.","DOI":"10.1145\/3368089.3409763"},{"key":"e_1_3_2_1_18_1","unstructured":"Aina Niemetz and Armin Biere. 2013. ddSMT: A Delta Debugger for the SMT-LIB v2 Format. In SMT \u201913. 36\u201345."},{"key":"e_1_3_2_1_19_1","volume-title":"Murxla: A Modular and Highly Extensible API Fuzzer for SMT Solvers. In CAV \u201922. 92\u2013106.","author":"Niemetz Aina","year":"2022","unstructured":"Aina Niemetz, Mathias Preiner, and Clark Barrett. 2022. Murxla: A Modular and Highly Extensible API Fuzzer for SMT Solvers. In CAV \u201922. 92\u2013106."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Theofilos Petsios Jason Zhao Angelos\u00a0D. Keromytis and Suman Jana. 2017. SlowFuzz: Automated Domain-Independent Detection of Algorithmic Complexity Vulnerabilities. In CCS \u201917. 2155\u20132168.","DOI":"10.1145\/3133956.3134073"},{"key":"e_1_3_2_1_21_1","volume-title":"SMACK: Decoupling Source Language Details from Verifier Implementations. In CAV \u201914. 106\u2013113.","author":"Rakamaric Zvonimir","year":"2014","unstructured":"Zvonimir Rakamaric and Michael Emmi. 2014. SMACK: Decoupling Source Language Details from Verifier Implementations. In CAV \u201914. 106\u2013113."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Du Shen Qi Luo Denys Poshyvanyk and Mark Grechanik. 2015. Automating Performance Bottleneck Detection Using Search-Based Application Profiling. In ISSTA \u201915. 270\u2013281.","DOI":"10.1145\/2771783.2771816"},{"key":"e_1_3_2_1_23_1","volume-title":"Program Synthesis by Sketching. Ph.\u00a0D. Dissertation","author":"Solar-Lezama Armando","unstructured":"Armando Solar-Lezama. 2008. Program Synthesis by Sketching. Ph.\u00a0D. Dissertation. University of California at Berkeley."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Emina Torlak and Rastislav Bodik. 2014. A lightweight symbolic virtual machine for solver-aided host languages. In PLDI \u201914. 530\u2013541.","DOI":"10.1145\/2594291.2594340"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Dominik Winterer Chengyu Zhang and Zhendong Su. 2020. On the Unusal Effectiveness of Type-Aware Operator Mutation. OOPSLA \u201920 1\u201325.","DOI":"10.1145\/3428261"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Dominik Winterer Chengyu Zhang and Zhendong Su. 2020. Validating SMT Solvers via Semantic Fusion. PLDI \u201920 718\u2013730.","DOI":"10.1145\/3385412.3385985"},{"key":"e_1_3_2_1_27_1","unstructured":"Dominik Winterer Chengyu Zhang and Zhendong Su. 2022. yinyang: a fuzzer for SMT solvers. Retrieved 2022-09-07 from https:\/\/github.com\/testsmt\/yinyang"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Peisen Yao Heqing Huang Wensheng Tang Qingkai Shi Rongxin Wu and Charles Zhang. 2021. Skeletal Approximation Enumeration for SMT Solver Testing. In FSE \u201921. 1141\u20131153.","DOI":"10.1145\/3468264.3468540"}],"event":{"name":"ASE '22: 37th IEEE\/ACM International Conference on Automated Software Engineering","location":"Rochester MI USA","acronym":"ASE '22"},"container-title":["Proceedings of the 37th IEEE\/ACM International Conference on Automated Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3551349.3560435","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3551349.3560435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T07:59:30Z","timestamp":1755849570000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3551349.3560435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,10]]},"references-count":28,"alternative-id":["10.1145\/3551349.3560435","10.1145\/3551349"],"URL":"https:\/\/doi.org\/10.1145\/3551349.3560435","relation":{},"subject":[],"published":{"date-parts":[[2022,10,10]]},"assertion":[{"value":"2023-01-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}