A refutation calculus for multimodular integer constraints using lifting and lowering between subsystems, implemented in cvc5, outperforms state-of-the-art solvers on cryptographic verification benchmarks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Integer Reasoning Modulo Different Constants in SMT
A refutation calculus for multimodular integer constraints using lifting and lowering between subsystems, implemented in cvc5, outperforms state-of-the-art solvers on cryptographic verification benchmarks.