{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,5]],"date-time":"2026-11-05T07:10:41Z","timestamp":1793862641725,"version":"4.6.1"},"reference-count":68,"publisher":"Association for Computing Machinery (ACM)","issue":"FSE","license":[{"start":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:00:00Z","timestamp":1750291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2022YFB4501903"],"award-info":[{"award-number":["2022YFB4501903"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["62172429 & 62032024"],"award-info":[{"award-number":["62172429 & 62032024"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Softw. Eng."],"published-print":{"date-parts":[[2025,6,19]]},"abstract":"<jats:p>Floating-point constraint solving is challenging due to the complex representation and non-linear computations. Search-based constraint solving provides an effective method for solving floating-point constraints. In this paper, we propose QSF to improve the efficiency of search-based solving for floating-point constraints. The key idea of QSF is to model the floating-point constraint solving problem as a multi-objective optimization problem. Specifically, QSF considers both the number of unsatisfied constraints and the sum of the violation degrees of unsatisfied constraints as the objectives for search-based optimization. Besides, we propose a new evolutionary algorithm in which the mutation operators are specially designed for floating-point numbers, aiming to solve the multi-objective problem more efficiently. We have implemented QSF and conducted extensive experiments on both the SMT-COMP benchmark and the benchmark from real-world floating-point programs. The results demonstrate that compared to SOTA floating-point solvers, QSF achieved an average speedup of 15.72X under a 60-second timeout and an impressive 87.48X under a 600-second timeout on the first benchmark. Similarly, on the second benchmark, QSF delivered an average speedup of 22.44X and 29.23X, respectively, under the two timeout configurations. Furthermore, QSF has also enhanced the performance of symbolic execution for floating-point programs.<\/jats:p>","DOI":"10.1145\/3715739","type":"journal-article","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T11:15:34Z","timestamp":1750331734000},"page":"511-532","source":"Crossref","is-referenced-by-count":2,"title":["QSF: Multi-objective Optimization Based Efficient Solving for Floating-Point Constraints"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6177-9164","authenticated-orcid":false,"given":"Xu","family":"Yang","sequence":"first","affiliation":[{"name":"National University of Defense Technology, College of Computer Science and Technology, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4066-7892","authenticated-orcid":false,"given":"Zhenbang","family":"Chen","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, College of Computer Science and Technology, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8033-7943","authenticated-orcid":false,"given":"Wei","family":"Dong","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, College of Computer Science and Technology, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0637-8744","authenticated-orcid":false,"given":"Ji","family":"Wang","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, College of Computer Science and Technology, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,19]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"1985. IEEE standard for binary floating-point arithmetic - IEEE standard 754-1985. Beuth."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020281327116"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/S10703-023-00423-0"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","unstructured":"Earl T. Barr Thanh Vo Vu Le and Zhendong Su. 2013. Automatic detection of floating-point exceptions. (2013) 549\u2013560. doi:10.1145\/2429069.2429133","DOI":"10.1145\/2429069.2429133"},{"key":"e_1_3_1_7_2","article-title":"The smt-lib standard: Version 2.0","volume":"13","author":"Barrett Clark","year":"2010","unstructured":"Clark Barrett, Aaron Stump, Cesare Tinelli, et al. 2010. The smt-lib standard: Version 2.0. In Proceedings of the 8th international workshop on satisfiability modulo theories (Edinburgh, UK), Vol. 13. 14.","journal-title":"Proceedings of the 8th international workshop on satisfiability modulo theories (Edinburgh, UK)"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Clark W. Barrett David L. Dill and Jeremy R. Levitt. 1998. A Decision Procedure for Bit-Vector Arithmetic. In Proceedings of the 35th Conference on Design Automation Moscone center San Francico California USA June 15-19 1998 Basant R. Chawla Randal E. Bryant and Jan M. Rabaey (Eds.). ACM Press 522\u2013527. doi:10.1145\/277044.277186","DOI":"10.1145\/277044.277186"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Aaron Bembenek Michael Greenberg and Stephen Chong. 2023. From SMT to ASP:Solver-Based Approaches to Solving Datalog Synthesis-as-Rule-Selection Problems. Proc. ACM Program. Lang. 7 POPL (2023) 185\u2013217. doi:10.1145\/3571200","DOI":"10.1145\/3571200"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.23919\/FMCAD.2017.8102235"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177011077"},{"key":"e_1_3_1_12_2","volume-title":"Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications","author":"Biere Armin","year":"2009","unstructured":"Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh (Eds.). 2009. Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, Vol. 185. IOS Press."},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2008.ECP.18"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74113-8"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17462-0_5"},{"key":"e_1_3_1_16_2","unstructured":"Cristian Cadar Daniel Dunbar and Dawson R. Engler. 2008. KLEE: Unassisted and Automatic Generation of High- Coverage Tests for Complex Systems Programs. In 8th USENIX Symposium on Operating Systems Design and Implementation OSDI 2008 December 8-10 2008 San Diego California USA Proceedings Richard Draves and Robbert van Renesse (Eds.). USENIX Association 209\u2013224. http:\/\/www.usenix.org\/events\/osdi08\/tech\/full_papers\/cadar\/cadar.pdf"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01442131"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","unstructured":"Tao Chen and Miqing Li. 2024. Adapting Multi-objectivized Software Configuration Tuning. Proc. ACM Softw. Eng. 1 FSE (2024) 539\u2013561. doi:10.1145\/3643751","DOI":"10.1145\/3643751"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_7"},{"key":"e_1_3_1_20_2","first-page":"143","volume-title":"The Complexity of Theorem-Proving Procedures","author":"Cook Stephen A.","year":"2023","unstructured":"Stephen A. Cook. 2023. The Complexity of Theorem-Proving Procedures (1 ed.). Association for Computing Machinery, New York, NY, USA, 143\u2013152.","edition":"1"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.4324\/9781315693361"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277190"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00234-2_1"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8_3"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1568-4946(02)00021-2"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508424"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO.2008.16.3.355"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41540-6_11"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63618-0_11"},{"key":"e_1_3_1_32_2","unstructured":"Mark Galassi Jim Davies James Theiler Brian Gough Gerard Jungman Patrick Alken Michael Booth Fabrice Rossi and Rhys Ulerich. 2002. GNU scientific library. Network Theory Limited Godalming."},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38574-2_14"},{"key":"e_1_3_1_34_2","unstructured":"Steven G. Johnson. 2007. The NLopt nonlinear-optimization package. https:\/\/github.com\/stevengj\/nlopt."},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-006-9101-0"},{"issue":"94720","key":"e_1_3_1_36_2","first-page":"11","article-title":"IEEE standard 754 for binary floating-point arithmetic","volume":"754","author":"Kahan William","year":"1996","unstructured":"William Kahan. 1996. IEEE standard 754 for binary floating-point arithmetic. Lecture Notes on the Status of IEEE 754, 94720-1776 (1996), 11.","journal-title":"Lecture Notes on the Status of IEEE"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","unstructured":"Mifa Kim Tomoyuki Hiroyasu Mitsunori Miki and Shinya Watanabe. 2004. SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2. 3242 (2004) 742\u2013751. doi:10.1007\/978-3-540-30217-9_75","DOI":"10.1007\/978-3-540-30217-9_75"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.5120\/ijca2017913370"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-50497-0"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16573-3_11"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2012.01.172"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3338906.3338921"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/S10479-021-04033-Z"},{"key":"e_1_3_1_46_2","volume-title":"The SMT Workshop","author":"Marre Bruno","year":"2017","unstructured":"Bruno Marre, Fran\u00e7ois Bobot, and Zakaria Chihani. 2017. Real Behavior of Floating Point Numbers. In The SMT Workshop. SMT 2017, 15th International Workshop on Satisfiability Modulo Theories, Heidelberg, Germany. https:\/\/cea.hal.science\/cea-01795760"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","unstructured":"Claude Michel Michel Rueher and Yahia Lebbah. 2001. Solving Constraints over Floating-Point Numbers. In Principles and Practice of Constraint Programming - CP 2001 7th International Conference CP 2001 Paphos Cyprus November 26 - December 1 2001 Proceedings (Lecture Notes in Computer Science Vol. 2239) Toby Walsh (Ed.). Springer 524\u2013538. doi:10.1007\/3-540-45578-7_36","DOI":"10.1007\/3-540-45578-7_36"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3611643.3616357"},{"key":"e_1_3_1_49_2","doi-asserted-by":"crossref","unstructured":"Aina Niemetz and Mathias Preiner. 2023. Bitwuzla. In Computer Aided Verification - 35th International Conference CAV 2023 Paris France July 17-22 2023 Proceedings Part II (Lecture Notes in Computer Science Vol. 13965) Constantin Enea and Akash Lal (Eds.). Springer 3\u201317.","DOI":"10.1007\/978-3-031-37703-7_1"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20398-5_22"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1998.6.3.231"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/S10515-014-0154-2"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/S10703-017-0270-2"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4145-2_5"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54013-4_19"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","unstructured":"Ziqi Shuai Zhenbang Chen Kelin Ma Kunlin Liu Yufeng Zhang Jun Sun and Ji Wang. 2024. Partial Solution Based Constraint Solving Cache in Symbolic Execution. Proc. ACM Softw. Eng. 1 FSE (2024) 2493\u20132514. doi:10.1145\/3660817","DOI":"10.1145\/3660817"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73190-0_2"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20398-5_26"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/3457784.3457823"},{"key":"e_1_3_1_60_2","unstructured":"Gilbert Syswerda. 1989. Uniform Crossover in Genetic Algorithms. In Proceedings of the 3rd International Conference on Genetic Algorithms George Mason University Fairfax Virginia USA June 1989 J. David Schaffer (Ed.). Morgan Kaufmann 2\u20139."},{"key":"e_1_3_1_61_2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/978-3-540-79124-9_10","volume-title":"Tests and Proofs,","author":"Tillmann Nikolai","year":"2008","unstructured":"Nikolai Tillmann and Jonathan de Halleux. 2008. Pex\u2013White Box Test Generation for .NET. In Tests and Proofs, Bernhard Beckert and Reiner H\u00e4hnle (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 134\u2013153."},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","DOI":"10.1002\/MALQ.200610007"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3252612"},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","unstructured":"Xu Yang Guofeng Zhang Ziqi Shuai Zhenbang Chen and Ji Wang. 2025. Symbolic execution of floating-point programs: How far are we? J. Syst. Softw. 220 112242. doi:10.1016\/J.JSS.2024.112242","DOI":"10.1016\/J.JSS.2024.112242"},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3118593"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.1145\/3324884.3416645"},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","unstructured":"Shasha Zhou Mingyu Huang Yanan Sun and Ke Li. 2024. Evolutionary Multi-objective Optimization for Contextual Adversarial Example Generation. Proc. ACM Softw. Eng. 1 FSE (2024) 2285\u20132308. doi:10.1145\/3660808","DOI":"10.1145\/3660808"},{"key":"e_1_3_1_69_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66158-2_45"}],"container-title":["Proceedings of the ACM on Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3715739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T11:05:02Z","timestamp":1787483102000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3715739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,19]]},"references-count":68,"journal-issue":{"issue":"FSE","published-print":{"date-parts":[[2025,6,19]]}},"alternative-id":["10.1145\/3715739"],"URL":"https:\/\/doi.org\/10.1145\/3715739","relation":{},"ISSN":["2994-970X"],"issn-type":[{"value":"2994-970X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,19]]}}}