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 …

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 …

While reactive synthesis and syntax-guided synthesis (SyGuS) have seen enormous
progress in recent years, combining the two approaches has remained a challenge. In this …

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 …

Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary
function terms. This allows for specifying dataintensive systems for which LTL is not …

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 …

Reactive synthesis builds a system from a specification given as a temporal logic formula.
Traditionally, reactive synthesis is defined for systems with Boolean input and output …

Contracts specifying a procedure's behavior in terms of pre-and postconditions are essential
for scalable software verification, but cannot express any constraints on the events occurring …

System requirements related to concepts like information flow, knowledge, and robustness
cannot be judged in terms of individual system executions, but rather require an analysis of …

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 …