
Structuring the Synthesis of HeapManipulating Programs  Extended Version
This paper describes a deductive approach to synthesizing imperative pro...
read it

Transforming Coroutining Logic Programs into Equivalent CHR Programs
We extend a technique called Compiling Control. The technique transforms...
read it

Concise ReadOnly Specifications for Better Synthesis of Programs with Pointers – Extended Version
In program synthesis there is a wellknown tradeoff between concise and...
read it

Automated Lemma Synthesis in SymbolicHeap Separation Logic
The symbolicheap fragment of separation logic has been actively develop...
read it

Comparative Synthesis: Learning Optimal Programs with Indeterminate Objectives
Quantitative program synthesis aims to generate a program that satisfies...
read it

Specifying Concurrent Programs in Separation Logic: Morphisms and Simulations
In addition to pre and postconditions, program specifications in recent...
read it

SENSE: AbstractionBased Synthesis of Networked Control Systems
While many studies and tools target the basic stabilizability problem of...
read it
Structuring the Synthesis of HeapManipulating Programs
This paper describes a deductive approach to synthesizing imperative programs with pointers from declarative specifications expressed in Separation Logic. Our synthesis algorithm takes as input a pair of assertionsa pre and a postconditionwhich describe two states of the symbolic heap, and derives a program that transforms one state into the other, guided by the shape of the heap. The program synthesis algorithm rests on the novel framework of Synthetic Separation Logic (SSL), which generalises the classical notion of heap entailment PQ to incorporate a possibility of transforming a heap satisfying an assertion P into a heap satisfying an assertion Q. A synthesized program represents a proof term for a transforming entailment statement PQ, and the synthesis procedure corresponds to a proof search. The derived programs are, thus, correct by construction, in the sense that they satisfy the ascribed pre/postconditions, and are accompanied by complete proof derivations, which can be checked independently. We have implemented a proof search engine for SSL in a form the program synthesizer called SuSLik. For efficiency, the engine exploits properties of SSL rules, such as invertibility and commutativity of rule applications on separate heaps, to prune the space of derivations it has to consider. We explain and showcase the use of SSL on characteristic examples, describe the design of SuSLik, and report on our experience of using it to synthesize a series of benchmark programs manipulating heapbased linked data structures.
READ FULL TEXT
Comments
There are no comments yet.