We present a new CEGAR-based algorithm for QBF. The algorithm builds on a
decomposition of QBFs into a sequence of propositional formulas, which we call the clausal …

We present the latest major release version 6.0 of the quantified Boolean formula (QBF)
solver DepQBF, which is based on QCDCL. QCDCL is an extension of the conflict-driven …

Boolean functional synthesis is a fundamental problem in computer science with wide-
ranging applications and has witnessed a surge of interest resulting in progressively …

The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its
PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become …

Automatic synthesis of hardware components from declarative specifications is an ambitious
endeavor in computer aided design. Existing synthesis algorithms are often implemented …

After a break of about five years, in 2016 the classical QBFEVAL has been revived.
QBFEVAL is a competitive evaluation of solvers for quantified Boolean formulas (QBF), the …

Given a Boolean specification between a set of inputs and outputs, the problem of Boolean
functional synthesis is to synthesise each output as a function of inputs such that the …

We present a novel approach to solve quantified boolean formulas with one quantifier
alternation (2QBF). The algorithm incrementally adds new constraints to the formula until the …

Formal verification is essential but challenging: Even the best verifiers may produce wrong
verification verdicts. Certifying verifiers enhance the confidence in verification results by …

Abstract For quantified Boolean formulas (QBFs), preprocessing is essential to solve many
real-world formulas. The application of a preprocessor, however, prevented the extraction of …