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.
(eds.): Handbook of Model Checking
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
verdicts
UNVERDICTED 5representative citing papers
HOA non-emptiness is NP-complete for standard acceptance conditions; inclusion is PSPACE-complete except EXPSPACE-complete for Emerson-Lei; HOG games are Pi2-complete for parity/safety and PSPACE-complete for Muller/Emerson-Lei.
Nested sequent calculi for intuitionistic grammar logics admit uniform cut-elimination via a shift rule and validity is undecidable.
Obligation properties in LTLf+ admit a direct symbolic translation to deterministic weak automata, enabling linear-time synthesis via DWA games with effectiveness comparable to LTLf.
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.
-
A Theory of Hanoi Omega-Automata and Games
HOA non-emptiness is NP-complete for standard acceptance conditions; inclusion is PSPACE-complete except EXPSPACE-complete for Emerson-Lei; HOG games are Pi2-complete for parity/safety and PSPACE-complete for Muller/Emerson-Lei.
-
Nested Sequents for Intuitionistic Multi-Modal Logics: Modularity, Cut-Elimination, and Undecidability
Nested sequent calculi for intuitionistic grammar logics admit uniform cut-elimination via a shift rule and validity is undecidable.
-
Symbolic Synthesis for LTLf+ Obligations
Obligation properties in LTLf+ admit a direct symbolic translation to deterministic weak automata, enabling linear-time synthesis via DWA games with effectiveness comparable to LTLf.
-
Equilibria in Multiplayer Graph Games: An Algorithmic Study
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.