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 present a method for synthesizing recursive functions that provably satisfy a given
specification in the form of a polymorphic refinement type. We observe that such …

We present a new method for automatically providing feedback for introductory
programming problems. In order to use this method, we need a reference implementation of …

Program Synthesis, which is the task of discovering programs that realize user intent, can be
useful in several scenarios: enabling people with no programming background to develop …

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 …

We introduce the first program synthesis engine implemented inside an SMT solver. We
present an approach that extracts solution functions from unsatisfiability proofs of the …

It is becoming increasingly important for applications to protect sensitive data. With current
techniques, the programmer bears the burden of ensuring that the application's behavior …

Input-output examples have emerged as a practical and user-friendly specification
mechanism for program synthesis in many environments. While example-driven tools have …

There are many tools that help programmers find code fragments, but most are inexpressive
and rely on static information. We present a new technique for synthesizing code that is …

By abstracting away the complexity of distributed systems, large-scale data processing
platforms—MapReduce, Hadoop, Spark, Dryad, etc.—have provided developers with simple …