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 …

Satisfiability modulo theory solvers are increasingly being used to solve quantified formulas
over structures such as integers and term algebras. Quantifier instantiation combined with …

HipSpec is a system for automatically deriving and proving properties about functional
programs. It uses a novel approach, combining theory exploration, counterexample testing …

Many compilers, synthesizers, and theorem provers rely on rewrite rules to simplify
expressions or prove equivalences. Develo** rewrite rules can be difficult: rules may be …

Rewrite rules are critical in equality saturation, an increasingly popular technique in
optimizing compilers, synthesizers, and verifiers. Unfortunately, develo** high-quality …

Algebraic laws of functions in mathematics–such as commutativity, associativity, and
idempotence–are often used as the basis to derive more sophisticated properties of complex …

Conflict-Free Replicated Data Types (CRDTs) are a recent approach for kee** replicated
data consistent while guaranteeing the absence of conflicts among replicas. For correct …

In this paper we introduce a new approach for proving quantified theorems over inductively
defined data-types. We present an automated prover that searches for a sequence of …

This paper describes Hipster, a system integrating theory exploration with the proof assistant
Isabelle/HOL. Theory exploration is a technique for automatically discovering new …

We introduce program synthesis with equivalence reduction, a synthesis methodology that
utilizes relational specifications over components of a given synthesis domain to reduce the …