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 …

The goal of programmatic Learning from Demonstration (LfD) is to learn a policy in a
programming language that can be used to control a robot's behavior from a set of user …

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 …

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 …

In recent years, Machine Learning (ML) models have achieved remarkable success in
various domains. However, these models also tend to demonstrate unsafe behaviors …

Smart contracts are small but highly security-critical programs that implement wallets, token
systems, auctions, crowd funding systems, elections, and other multi-party transactions on …

Deep neural networks (DNNs) play a crucial role in the field of machine learning,
demonstrating state-of-the-art performance across various application domains. However …