Solving QBF by Abstraction

@inproceedings{HeckingHarbusch2018SolvingQB,
  title={Solving QBF by Abstraction},
  author={Jesko Hecking-Harbusch and Leander Tentrup},
  booktitle={GandALF},
  year={2018}
}
Many verification and synthesis approaches rely on solving techniques for quantified Boolean formulas (QBF). Consequently, solution witnesses, in the form of Boolean functions, become more and more important as they represent implementations or counterexamples. We present a recursive counterexample guided abstraction and refinement algorithm (CEGAR) for solving and certifying QBFs that exploits structural reasoning on the formula level. The algorithm decomposes the given QBF into one… 

Figures and Tables from this paper

CAQE and QuAbS: Abstraction Based QBF Solvers
TLDR
The clausal abstraction algorithm started as a solving algorithm for QBFs in prenex conjunctive normal form incorporating an efficient Skolem and Herbrand function extraction and was extended to non-prenex and negation normal form formulas, leading the way for improved performance in solving and function extraction.
Clausal Abstraction for DQBF
TLDR
The clausal abstraction algorithm for quantified Boolean formulas (QBF) is lifted to DQBF, a logic admitting existential quantification over Boolean functions, which allows for elegantly state synthesis problems in verification such as the search for invariants, programs, or winning regions of games.
Clausal Abstraction for DQBF (full version)
TLDR
The clausal abstraction algorithm for quantified Boolean formulas (QBF) is lifted to DQBF, and the implementation dCAQE solves significantly more formulas than the existing DQ BF algorithms.
Non-prenex QBF Solving Using Abstraction
TLDR
A modified algorithm is presented that lifts the restriction on prenex quantifiers and handles tree-shaped quantifier hierarchies where different branches can be solved independently and exploits this property by solving independent branches in parallel.
Parallel Solving of Quantified Boolean Formulas
TLDR
This chapter reviews and compares approaches for solving QBFs in parallel and concludes that QBFs provide an attractive framework for encoding many applications from verification, artificial intelligence, and synthesis, thus motivating the quest for efficient solving technology.
A Cube Distribution Approach to QBF Solving and Certificate Minimization
TLDR
A new view on QBF solving and certificate generation is given by the cube distribution interpretation, which provides a largely increased flexibility for QBF reasoning and allows compact certificate derivation with don’t cares.
Encodings of Bounded Synthesis
TLDR
This paper considers different reductions of the bounded synthesis problem of linear-time temporal logic to constraint systems given as Boolean formulas (SAT), quantified boolean formulas (QBF), and dependency quantifiedolean formulas (DQBF).
Bounded Model Checking for Hyperproperties
This paper introduces a bounded model checking (BMC) algorithm for hyperproperties expressed in HyperLTL, which — to the best of our knowledge — is the first such algorithm. Just as the classic BMC
HyperQube: A QBF-Based Bounded Model Checker for Hyperproperties
TLDR
This paper presents HyperQube, a push-button QBF-based bounded model checker for hyperproperties, which takes as input a NuSMV model and a formula expressed in the temporal logic HyperLTL to seamlessly deal with quantifier alternations.
Symbolic vs. Bounded Synthesis for Petri Games
TLDR
Bounded synthesis is compared to the existing implementation of the symbolic approach in the synthesis tool ADAM, and experimental results on a collection of benchmarks are presented, including one new benchmark family, modeling manufacturing and workflow scenarios with multiple concurrent processes.
...
...

References

SHOWING 1-10 OF 63 REFERENCES
Non-prenex QBF Solving Using Abstraction
TLDR
A modified algorithm is presented that lifts the restriction on prenex quantifiers and handles tree-shaped quantifier hierarchies where different branches can be solved independently and exploits this property by solving independent branches in parallel.
CAQE: A Certifying QBF Solver
TLDR
A new CEGAR-based algorithm for QBF is presented that builds on a decomposition of QBFs into a sequence of propositional formulas, which is called the clausal abstraction, which leads to a simpler notion of refinement compared to earlier approaches.
QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving
TLDR
This paper proposes a QBF solver using levelized SAT solving in the flavor of formula expansion, and shows that the prototype implementation is comparable with state-of-the-art solvers and outperforms other solvers in certain instances.
Solving QBF by Clause Selection
TLDR
A novel QBF algorithm is developed, which generalizes the concept of enumeration of implicit hitting sets and is competitive with, and often outperforms, the state of the art in QBF solving.
Proving QBF-hardness in Bounded Model Checking for Incomplete Designs
TLDR
The concept of QBF-hardness is introduced in this paper, a classification of problems for which theQBF-based modeling does not provide a result, and an iterative method to prove the QBF -hardness.
A solver for QBFs in negation normal form
TLDR
Algorithms for QBFs are extended to the non-normal form case and properties of the algorithms generalized to non-clausal form are proved by using a novel approach based on a sequent-style formulation of the calculus.
Unified QBF certification and its applications
TLDR
This paper identifies the missing Herbrand-function countermodel for false QBF, and strengthens the connection between syntactic and semantic certificates by showing that, given a trueQBF, its Skolem-function model is derivable from its cube-resolution proof of satisfiability as well as from its clause- resolution proof of unsatisfiability under formula negation.
SAT-Based Synthesis Methods for Safety Specs
TLDR
This work proposes several new methods to synthesize finite-state systems from safety specifications using decision procedures for the satisfiability of quantified and unquantified Boolean formulas SAT-, QBF- and EPR-solvers.
Exploiting QBF Duality on a Circuit Representation
TLDR
It is demonstrated how a circuit representation for QBF can support the propagation of dual truth values, which support the identical techniques of unit propagation and clause learning, except now it is satisfying assignments rather than falsifying assignments that are pruned.
Solving QBF with Counterexample Guided Refinement
TLDR
Two promising avenues in QBF are opened: CEGAR-driven solvers as an alternative to existing approaches and a novel type of learning in DPLL.
...
...