Strategies for the synthesis of algorithms

A number of strategies for the construction of algorithms from a given input-output specification of a problem are presented, Their application is illustrated by a detailed synthesis of the usual MAXIMUM algorithm and Hoares FIND algorithm.

[1]  Frank M. Brown,et al.  Inductive Reasoning in Mathematics , 1977, IJCAI.

[2]  C. A. R. Hoare,et al.  Algorithm 65: find , 1961, Commun. ACM.

[3]  Robert W. Floyd.  Toward Interactive Design of Correct Programs , 1971, IFIP Congress.

[4]  Wolfgang Bibel.  Prädikatives Programmieren , 1975, Automata Theory and Formal Languages.

[5]  Zohar Manna,et al.  Toward automatic program synthesis , 1971, Symposium on Semantics of Algorithmic Languages.

[6]  Frank M. Brown,et al.  A Theorem Prover for Elementary Set Theory , 1977, IJCAI.

[7]  W. W. Bledsoe,et al.  Set Variables , 1977, IJCAI.

[8]  Paul Rovner,et al.  Techniques for the automatic selection of data structures , 1976, POPL.

[9]  Robert A. Kowalski,et al.  Algorithm = logic + control , 1979, CACM.

[10]  David C. Luckham,et al.  On automating the construction of programs. , 1974 .

[11]  Zohar Manna,et al.  The automatic synthesis of recursive programs , 1977, SIGART Newsl..

[12]  C. A. R. Hoare,et al.  Algorithm 64: Quicksort , 1961, Commun. ACM.