A novel decision procedure for arrays with constant arrays in SMT, supporting any index domain with an abstract calculus, soundness proofs, and implementation in Bitwuzla.
In: Irfan, A., Kaufmann, D
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A hybrid multimodular polynomial reasoning method verifies arithmetic circuits without large-integer arithmetic by running computations in parallel modulo different primes.
citing papers explorer
-
Satisfiability Modulo Extensional Constant Arrays (Extended Version)
A novel decision procedure for arrays with constant arrays in SMT, supporting any index domain with an abstract calculus, soundness proofs, and implementation in Bitwuzla.
-
Avoiding Big Integers: Parallel Multimodular Algebraic Verification of Arithmetic Circuits
A hybrid multimodular polynomial reasoning method verifies arithmetic circuits without large-integer arithmetic by running computations in parallel modulo different primes.