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: Fisman, D., Rosu, G
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
SIMBA is a cache-free GPU-accelerated bottom-up enumerator for mixed-boolean arithmetic that solves larger instances faster than prior CPU and cached-GPU tools.
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.
-
GPU-Accelerated Synthesis of Mixed-Boolean Arithmetic: Beyond Caching
SIMBA is a cache-free GPU-accelerated bottom-up enumerator for mixed-boolean arithmetic that solves larger instances faster than prior CPU and cached-GPU tools.