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 a deductive approach to synthesizing imperative programs with
pointers from declarative specifications expressed in Separation Logic. Our synthesis …

The last decade has seen a dramatic growth in the use of constraint solvers as a
computational mechanism, not only for analysis of software, but also at runtime. Solvers are …

We describe the first approach to automatically synthesizing heap-manipulating programs
with auxiliary recursive procedures. Such procedures occur routinely in data structure …

One vision for program synthesis, and specifically for programming by example (PBE), is an
interactive programmer's assistant, integrated into the development environment. To make …

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 …

This chapter surveys the research in parallel or distributed strategies for mechanical
theorem proving in first-order logic, and explores some of its connections with the research …

Functionality of software systems has exploded in part because of advances in programming
language support for packaging reusable functionality as libraries. Developers benefit from …

Abstract SGGS (Semantically-Guided Goal-Sensitive reasoning) is a clausal theorem-
proving method, which generalizes to first-order logic the Davis-Putnam-Loveland …