Search-based program synthesis Page 1 84 COMMUNICATIONS OF THE ACM | DECEMBER
2018 | VOL. 61 | NO. 12 review articles Writing programs that are both correct and efficient is …

Identifying invariants is an important program analysis task with applications towards
program understanding, bug finding, vulnerability analysis, and formal verification. Existing …

The classical formulation of the program-synthesis problem is to find a program that meets a
correctness specification given as a logical formula. Recent work on program synthesis and …

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 …

A fundamental problem in program verification concerns inferring loop invariants. The
problem is undecidable and even practical instances are challenging. Inspired by how …

Inductive invariants can be robustly synthesized using a learning model where the teacher is
a program verifier who instructs the learner through concrete program configurations …

In recent years, the notion of local robustness (or robustness for short) has emerged as a
desirable property of deep neural networks. Intuitively, robustness means that small …

We extend the data-driven approach to inferring preconditions for code from a set of test
executions. Prior work requires a fixed set of features, atomic predicates that define the …

In recent years they have been numerous works that aim to automate relational verification.
Meanwhile, although Constrained Horn Clauses (CHCs CHCs) empower a wide range of …

The code written by developers usually suffers from efficiency problems and contain various
performance bugs. These inefficiencies necessitate the research of automated refactoring …