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: Information Processing, Proceedings of the 2nd IFIP Congress 1962, Munich, Germany, August 27 - September 1, 1962
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.