We present a method for example-guided synthesis of functional programs over recursive
data structures. Given a set of input-output examples, our method synthesizes a program in …

Automatic program verification and symbolic model checking tools interface with theorem
proving technologies that check satisfiability of formulas. A theme pursued in the past years …

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

Differential privacy has emerged as a promising probabilistic formulation of privacy,
generating intense interest within academia and industry. We present a push-button …

Many problems in program analysis, verification, and synthesis require inferring
specifications of unknown procedures. Motivated by a broad range of applications, we …

This paper presents a new approach for synthesizing transformations on tree-structured
data, such as Unix directories and XML documents. We consider a general abstraction for …

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 …

Stateless model checking (SMC) is one of the standard approaches to the verification of
concurrent programs. As scheduling non-determinism creates exponentially large spaces of …

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 …