Automatic Deductive Synthesis of Lisp Programs in the System ALISA

Korukhova, Y.

doi:10.1007/11853886_21

Cited by 3 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is an extension of the ideas described in [17]. The problem consists of reducing the search space of possible proof attempts, which is necessary for application of a deductive synthesis method in practice.…”

Section: Discussionmentioning

confidence: 99%

An approach to automatic deductive synthesis of functional programs

Korukhova

2007

Ann Math Artif Intell

Self Cite

View full text Add to dashboard Cite

The work deals with automatic deductive synthesis of functional programs. Formal specification of a program is taken as a mathematical existence theorem and while proving it, we derive a program and simultaneously prove that this program corresponds to given specification. Several problems have to be resolved for automatic synthesis: the choice of synthesis rules that allows us to derive the basic constructions of a functional program, order of rule application and choice of a particular induction rule. The method proposed here is based on the deductive tableau method. The basic method gives rules for functional program construction.To determine the proof strategy we use some external heuristics, including rippling. And for the induction hypothesis formation the combination of rippling and the deductive tableau method became very useful. The proposed techniques are implemented in the system ALISA (Automatic Lisp Synthesizer) and used for automatic synthesis of several functions in the Lisp language.

show abstract

Section: Discussionmentioning

confidence: 99%