A Deductive Approach to Program Synthesis

Manna, Zohar; Waldinger, Richard

doi:10.1145/357084.357090

Cited by 418 publications

(84 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Castaing also describes the steps that correspond to Aubin-2, and Boyer and Moore's cross-fertilisation heuristic. The process of unfolding definitions in a lemma and then using the induction hypothesis is the basis of a number of program transformation and synthesis systems [14,15,16]. It is therefore not surprising that these systems also need to use some degree of generalisation.…”

Section: Bibliographic Remarksmentioning

confidence: 99%

Review of heuristics for generalisation

Vadera

1995

Softw. Eng. J. UK

View full text Add to dashboard Cite

Proof by induction plays a central role in showing that recursive programs satisfy their specification. Sometimes a key step is to generalise a lemma so that its inductive proof is easier. Existing heuristics for generalisation for induction are examined. The applicability of heuristics for generalisation is also examined, and it is shown that the kind of examples on which some of the heuristics work best form a well defined class of problems. A class of generalisation problems is identified for which none of the methods work, and directions for future research are provided.

show abstract

Section: Bibliographic Remarksmentioning

confidence: 99%

Review of heuristics for generalisation

Vadera

1995

Softw. Eng. J. UK

View full text Add to dashboard Cite

show abstract

“…(Cf. the methodologies of, e.g., Burstall and Darlington (1977), Manna and Waldinger (1980), Clark (1981), andHogger (1981). )…”

Section: Synthesismentioning

confidence: 99%

Completion and Its Applications

Dershowitz

1989

Rewriting Techniques

View full text Add to dashboard Cite

“…It has received increased attention recently, but has been studied for decades [3,11,12,16]. Our paper pursues the synthesis of functions mapping inputs to outputs.…”

Section: Introductionmentioning

confidence: 99%

Reductions for Synthesis Procedures

Jacobs

Kunčak

Suter

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. A synthesis procedure acts as a compiler for declarative specifications. It accepts a formula describing a relation between inputs and outputs, and generates a function implementing this relation. This paper presents the first synthesis procedures for 1) algebraic data types and 2) arrays. Our procedures are reductions that lift a synthesis procedure for the elements into synthesis procedures for containers storing these elements. We introduce a framework to describe synthesis procedures as systematic applications of inference rules. We show that, by interpreting both synthesis problems and programs as relations, we can derive and modularly prove widely applicable transformation rules, simplifying both the presentation and the correctness argument.

show abstract

A Deductive Approach to Program Synthesis

Cited by 418 publications

References 7 publications

Review of heuristics for generalisation

Review of heuristics for generalisation

Completion and Its Applications

Reductions for Synthesis Procedures

Contact Info

Product

Resources

About