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: Chockler, H., Weissenbacher, G
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
representative citing papers
CDCL SAT solvers compute small proofdoors on linearly scaling BMC families but large non-absorbed ones on exponential families, as shown by empirical measurements on a 76k+ instance benchmark where prior parameters fail to discriminate regimes.
Efficient priority minimization for deterministic parity automata with don't care words is possible via a general result; WDBA have unique minimal forms under trivial right-congruence don't cares with a congruence characterization, but the informative right-congruence class has no unique minimal and
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
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.
-
Understanding CDCL Solvers via Scalability Studies and Proofdoors
CDCL SAT solvers compute small proofdoors on linearly scaling BMC families but large non-absorbed ones on exponential families, as shown by empirical measurements on a 76k+ instance benchmark where prior parameters fail to discriminate regimes.
-
On Minimization and Learning of Deterministic $\omega$-Automata in the Presence of Don't Care Words
Efficient priority minimization for deterministic parity automata with don't care words is possible via a general result; WDBA have unique minimal forms under trivial right-congruence don't cares with a congruence characterization, but the informative right-congruence class has no unique minimal and
-
Equilibria in Multiplayer Graph Games: An Algorithmic Study
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.