A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Toward automatic program synthesis
Communications of the ACM
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Cost analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Program synthesis based on Boyer-Moore theorem proving techniques
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Communications of the ACM
Improving and refining programs by program manipulation
ACM '76 Proceedings of the 1976 annual conference
Structured programming and automatic program synthesis
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Heuristics for program synthesis using loop invariants
ACM '78 Proceedings of the 1978 annual conference - Volume 2
The use of examples in program construction and debugging
ACM '75 Proceedings of the 1975 annual conference
ACM SIGART Bulletin
An approach to automatic deductive synthesis of functional programs
Annals of Mathematics and Artificial Intelligence
Speeding up the Synthesis of Programs from Traces
IEEE Transactions on Computers
Automatic program synthesis from example problems
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Toward efficiency trough generality
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Automatic deductive synthesis of lisp programs in the system ALISA
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
| Hi-index | 48.24 |
An improved program-synthesizing algorithm based on the algorithm proposed by Waldinger and Lee in 1969 is given. In the old algorithm, the program-synthesizing problem is translated into a theorem-proving problem, and a program is obtained by analyzing a proof. For the improved algorithm, the analysis is not necessary, and a program is obtained as soon as the proof is completed. This is achieved by using a modified variable tracing mechanism invented by Green in 1969. The correctness of the improved algorithm is also proved; i.e. the program thus obtained always satisfies the specification.