The decision problem of quantified Boolean formulas (QBFs) is the archetypical problem for
the complexity class PSPACE. Beside such theoretical aspects QBF also provides an …

Solvers for quantified Boolean formulas (QBF) have become powerful tools for tackling hard
computational problems from various application domains, even beyond the scope of SAT …

We report on the last four editions of the reactive synthesis competition (SYNTCOMP 2018–
2021). We briefly describe the evaluation scheme and the experimental setup of …

The reactive synthesis problem is to compute a system satisfying a given specification in
temporal logic. Bounded synthesis is the approach to bound the maximum size of the system …

Circuit synthesis is the task of decomposing a given logical functionality into a sequence of
elementary gates. It is (depth-) optimal if it is impossible to achieve the desired functionality …

We report on the fourth reactive synthesis competition (SYNTCOMP 2017). We introduce two
new benchmark classes that have been added to the SYNTCOMP library, and briefly …

Given a specification of Linear-time Temporal Logic interpreted over finite traces (LTLf), the
reactive synthesis problem asks to find a finitely-representable, terminating controller that …

Temporal synthesis is the automated design of a system that interacts with an environment,
using the declarative specification of the system's behavior. A popular language for …

Abstract Dependency quantified Boolean formulas (DQBFs) as a generalization of quantified
Boolean formulas (QBFs) have received considerable attention in research during the last …

We present our new preprocessor HQSpre, a state-of-the-art tool for simplifying quantified
Boolean formulas (QBFs) and the first available preprocessor for dependency quantified …