Compiler Optimizations-based SMT Simplifications: An In-Depth Study
ACM Transactions on Software Engineering and Methodology · 30.11.2026 · 35 (11) · 1-36
DOI: 10.1145/3795879 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Software Engineering and Methodology, online erschienen am 04.11.2026. Verfasst von Hanyun Jiang und 4 weiteren Autor:innen. Die Arbeit nennt 100 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Cryptologic Science Fund of China, National Natural Science Foundation of China, CCF-Huawei Populus Euphratica Fund.
Abstract (Originalsprache)
SMT solvers are a cornerstone in numerous domains, such as program verification, repair, and synthesis. While formula simplification is a crucial preprocessing step that directly impacts solver efficiency, existing approaches predominantly rely on handcrafted heuristics. Recent advances have explored using compiler optimizations to automate and enhance formula simplifications. Despite their promise, the synergy between compiler optimizations and SMT simplifications remains insufficiently understood and underexploited. This article presents a comprehensive study of the interplay between compiler optimizations and SMT formula simplifications. We show that iterative search for optimization configurations significantly improves formula simplifications, yielding a geometric mean speed-up of 2.96 \(\times\) over default solvers and 2.12 \(\times\) over SLOT on large-scale benchmarks. We present strong evidence for the effectiveness of machine learning-based methods in automating the selection of optimization configurations tailored to specific problem instances, achieving geometric mean speed-ups of 1.15 \(\times\) over Z3 and 1.54 \(\times\) over CVC5. Finally, we discuss promising directions for improving the applicability and effectiveness of compiler optimization-driven approaches to SMT simplifications.
Förderung
- National Cryptologic Science Fund of China
- National Natural Science Foundation of China
- CCF-Huawei Populus Euphratica Fund
Zitieren
APA
Jiang, H., Yao, P., Lu, J., Zhao, Y., & Ren, K. (2026). Compiler Optimizations-based SMT Simplifications: An In-Depth Study. ACM Transactions on Software Engineering and Methodology, 35(11), 1-36. https://doi.org/10.1145/3795879
Vancouver
Jiang H, Yao P, Lu J, Zhao Y, Ren K. Compiler Optimizations-based SMT Simplifications: An In-Depth Study. ACM Transactions on Software Engineering and Methodology. 2026;35(11):1-36. doi:10.1145/3795879
BibTeX
@article{Jiang2026,
author = {Jiang, Hanyun and Yao, Peisen and Lu, Jiachen and Zhao, Yongwang and Ren, Kui},
title = {Compiler Optimizations-based SMT Simplifications: An In-Depth Study},
journal = {ACM Transactions on Software Engineering and Methodology},
year = {2026},
volume = {35},
number = {11},
pages = {1--36},
doi = {10.1145/3795879}
}
EUVIMED