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 …

This paper describes work in continuous reasoning, where formal reasoning about a
(changing) codebase is done in a fashion which mirrors the iterative, continuous model of …

Modifications to the data representation of an abstract data type (ADT) can require
significant semantic refactoring of the code. Motivated by this observation, this paper …

Characterization of bugs and attack vectors is in many practical scenarios as important as
their finding. Recently, Girol et. al. have introduced the concept of robust reachability, which …

Symbolic execution systematically explores program paths by solving path conditions---
formulas over symbolic variables. Typically, the symbolic variables range over numbers …

The problem of synthesizing specifications of undefined procedures has a broad range of
applications, but the usefulness of the generated specifications depends on their quality. In …

We propose a fully automated method that takes as input an iterative or recursive reference
implementation and produces divide-and-conquer implementations that are functionally …

Many problems in formal methods can be formalized as two-player games. For several
applications—program synthesis, for example—in addition to determining which player wins …

In this paper, we present a novel learning framework for inferring stateful preconditions (ie,
preconditions constraining not only primitive-type inputs but also non-primitive-type object …

This paper presents a symbolic method for automatic theorem generation based on
deductive inference. Many software verification and reasoning tasks require proving …