Temporal hyperproperties are system properties that relate multiple execution traces. For
(finite-state) hardware, temporal hyperproperties are supported by model checking …

In this paper, we address the problem of the (reactive) realizability of specifications of
theories richer than Booleans, including arithmetic theories. Our approach transforms theory …

Reactive synthesis is the process of generate correct con-trollers from temporal logic
specifications. Typically, synthesis is restricted to Boolean specifications in LTL. Recently, a …

Reactive systems that operate in environments with complex data, such as mobile apps or
embedded controllers with many sensors, are difficult to synthesize. Synthesis tools usually …

In this paper we study the problem of realizability of reactive specifications written in LTL T,
which is the extension of LTL where atomic propositions can be literals from a first-order …

Abstract Reasoning about data structures requires powerful logics supporting the
combination of structural and data properties. We define a new logic called Mso-d (Monadic …

Infinite-state games are a commonly used model for the synthesis of reactive systems with
unbounded data domains. Symbolic methods for solving such games need to be able to …

Two-player graph games have found numerous applications, most notably in the synthesis
of reactive systems from temporal specifications, but also in verification. The relevance of …

Checking satisfiability of formulae in the theory of linear arithmetic has far reaching
applications, including program verification and synthesis. Many satisfiability solvers excel at …

We present a causality-based algorithm for solving two-player reachability games
represented by logical constraints. These games are a useful formalism to model a wide …