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 …

We present a novel bottom-up method for the synthesis of functional recursive programs.
While bottom-up synthesis techniques can work better than top-down methods in certain …

We propose a novel trace-guided approach to tackle the challenges of ambiguity and
generalization in synthesis of recursive functional programs from input-output examples. Our …

We present a novel approach to synthesizing recursive functional programs from input-
output examples. Synthesizing a recursive function is challenging because recursive …

The Rust type system guarantees memory safety and data-race freedom. However, to satisfy
Rust's type rules, many familiar implementation patterns must be adapted substantially …

Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities |
SpringerLink Skip to main content Advertisement SpringerLink Account Menu Find a journal …

We turn saturation-based theorem proving into an automated framework for recursive
program synthesis. We introduce magic axioms as valid induction axioms and use them …

Cyclic proof systems, in which induction is managed implicitly, are a promising approach to
automatic verification. The soundness of cyclic proof graphs is ensured by checking them …

In this paper, we propose an automated approach to finding correct and efficient
memoization algorithms from a given declarative specification. This problem has two major …

Automated deductive program synthesis promises to generate executable programs from
concise specifications, along with proofs of correctness that can be independently verified …