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 …

We address the problem of automatically synthesizing digital designs from linear-time
specifications. We consider various classes of specifications that can be synthesized with …

History-deterministic automata are an intermediate automata model, in between
deterministic and nondeterministic ones. An automaton is history-deterministic if its …

We study the problem of programmatic reinforcement learning, in which policies are
represented as short programs in a symbolic language. Programmatic policies can be more …

Graph-based games are an important tool in computer science. They have applications in
synthesis, verification, refinement, and far beyond. We review graph-based games with …

The goal of automatic program repair is to identify a set of syntactic changes that can turn a
program that is incorrect with respect to a given specification into a correct one. Existing …

Energy parity games are infinite two-player turn-based games played on weighted graphs.
The objective of the game combines a (qualitative) parity condition with the (quantitative) …

We present a novel framework for automatic inference of efficient synchronization in
concurrent programs, a task known to be difficult and error-prone when done manually. Our …

Smart contracts are computer programs that are executed by a network of mutually
distrusting agents, without the need of an external trusted authority. Smart contracts handle …

Recently, there has been an effort to add quantitative objectives to formal verification and
synthesis. We introduce and investigate the extension of temporal logics with quantitative …