SPLASH 2026
Sun 4 - Fri 9 October 2026 Oakland, California, United States
co-located with SPLASH/ISSTA 2026
Mon 5 Oct 2026 14:24 - 14:42 at Junior Ballroom 3&4 - Testing Compilers and Solvers Chair(s): Harrison Goldstein

Optimization Modulo Theories (OMT) extends Satisfiability Modulo Theories (SMT) by integrating logical reasoning with numerical optimization to address constrained optimization problems across diverse theories.
Optimizing SMT solvers (also known as OMT solvers), designed to handle such problems, serve as foundational components in numerous applications within programming languages research and practice.
However, despite their widespread adoption, OMT solvers are susceptible to subtle yet critical bugs that can silently mislead downstream applications by providing incorrect optimal solutions, potentially leading to severe consequences.
Validating these solvers poses a fundamental challenge, as obtaining precise ground truth for optimal solutions is inherently difficult, particularly under complex or theory-specific objective functions.
Moreover, existing SMT solver testing techniques are inadequate, as they fail to capture the intricate interplay between satisfiability checking and optimization reasoning in OMT.
To overcome these challenges, we propose cross-theory approximation, a novel validation methodology that leverages the relationships between solution spaces of different logical theories.
The key insight is that an optimal solution produced in one theory should maintain expected relationships when interpreted in another comparable theory's solution space.
By defining these cross-theory consistency properties and comparing optimal solutions obtained through theory-specific transformations, we can detect discrepancies that indicate potential solver bugs.
For instance, an integer-optimal solution should map cleanly into the broader real-arithmetic domain; deviations from this expected relationship signal incorrect optimization behavior.
We implement this methodology in Iris, a practical framework for validating OMT solvers.
When testing on the advanced OMT solvers, including Z3 and OptiMathSAT, Iris uncovers 24 previously unknown bugs, 20 of which were subsequently resolved by developers.
Notably, most of our reported bugs are correctness issues, emphasizing the effectiveness of our approach in enhancing OMT solver reliability.

Mon 5 Oct

Displayed time zone: Pacific Time (US & Canada) change

13:30 - 15:00
Testing Compilers and SolversOOPSLA at Junior Ballroom 3&4
Chair(s): Harrison Goldstein University at Buffalo
13:30
18m
Talk
BackSmith: A Systematic Approach to Testing Compiler Backends
OOPSLA
Hongyu Chen Nanjing University, Yu Wang Nanjing University, Jianhua Zhao Nanjing University, Ke Wang Nanjing University
DOI
14:06
18m
Talk
Seeking Evidence of Further Optimization: Detecting Missed Optimizations through Compiler’s Native Analyses
OOPSLA
Yi Zhang Nanjing University, Yu Wang Nanjing University, Ke Wang Nanjing University, Linzhang Wang Nanjing University
DOI
14:24
18m
Talk
Validating Optimizing SMT Solvers via Cross-Theory Approximation
OOPSLA
Maolin Sun Nanjing University, Fuqi Jia Institute of Software at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Yibiao Yang Nanjing University, Yuming Zhou Nanjing University
DOI