This is the authors' abstract. We don't add key points for this paper.
This is the artifact for our TACAS '27 submission. Sundance is an SMT solver for program verification with support for uninterpreted functions, linear integer arithmetic, and quantifier instantiation. In this artifact we compare it against other SMT solvers like Z3, cvc5, and alt-ergo on program verification benchmarks from Verus, Dafny, and F*.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Shah et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: