Toward Automatic Program Synthesis

Communications of the ACM

Volumn 14, Issue 3, 1971, Pages 151-165

  Manna, Zohar ^a   Waldinger, Richard J ^b  

^a STANFORD UNIVERSITY   (United States)

^b SRI INTERNATIONAL   (United States)

Author keywords

answer extraction; artificial intelligence; automatic program synthesis; mathematical induction principle; problem solving; theorem proving

Indexed keywords

ITERATIVE METHODS; PROBLEM SOLVING; SPECIFICATIONS; ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; CACMA; COMPUTER METATHEORY; COMPUTERS, LANGUAGES; COMPUTERS, PROGRAMMING; THEOREM PROVING;

ANSWER EXTRACTION; AUTOMATIC CONSTRUCTION; AUTOMATIC PROGRAM SYNTHESIS; AUTOMATIC PROGRAMS; INDUCTION PRINCIPLES; MATHEMATICAL INDUCTION; MATHEMATICAL INDUCTION PRINCIPLE; PROBLEM-SOLVING; PROGRAM SYNTHESIS; TECHNICAL DETAILS;

THEOREM PROVING;

EID: 0015022289     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/362566.362568     Document Type: Article

References (29)

1. Ashcroft, E. A. Mathematical logic applied to the semantics of computer programs. Ph.D. Thesis, 1970, Imperial College, London.
2. Brice, C., and Derksen, J. A heuristically guided equality rule in a resolution theorem prover. Tech. Note 45, Stanford Res. Inst., Artificial Intelligence Group, Menlo Park, Calif.
3. Burstall, R. M. Proving properties of programs by structural induction. Comp. J. 12, 1 (1969), 41-48.
4. Burstall, R. M. Formal description of program structure and semantics in first-order logic. In Machine Intelligence 5, Meltzer and Michie, Eds., Edinburgh U. Press, Edinburgh, 1970, pp. 79-98.
5. Floyd, R. W. Assigning meaning to programs. In Proc. Symposia in Applied Mathematics, Vol. 19, American Mathematical Society, 1967, pp. 19-32.
6. Green, C. Application of theorem proving to problem solving. Proc. International Joint Conf. on Artificial Intelligence, Washington, D.C., 1969.
7. Green, C. The application of theorem proving to question-answering systems. Ph.D. Thesis, 1969, Stanford U., Standford, Calif.
8. Green, C. and Raphael, B. The use of theorem-proving techniques in question-anwering systems. Proc. 23rd Nat. Conf. acm. Brandon/Systems Press, Princeton, N. J., 1968.
9. Hayes, P. J. A machine-oriented formulation of the extended functional calculus. Memo 62, Stanford Artificial Intelligence Proj., Stanford U., Stanford, Calif., 1969. Also appeared as Metamathematics Unit Report, U. of Edinburgh, Scotland.
10. King, J. A program verifier. Ph.D. Thesis, 1969, Carnegie-Mellon U., Pittsburgh, Pa.
11. King, J. and Floyd, R. W. Interpretation Oriented Theorem Prover Over Integers. Second Ann. acm Symp. on Theory of Computing, Northampton, Mass., 1970.
12. Luckham, D., and Nilsson, N. J. Extracting information from resolution proof trees. Tech. Note 32, Stanford Res. Inst., Artificial Intelligence Group, Menlo Park, Calif., 1970.
13. Manna, Z. The correctness of programs. J. Computer and System Sciences 3, 2, (1969), 119-127.
14. Manna, Z. and McCarthy, J. Properties of programs and partial function logic. In Machine Intelligence 5, Meltzer and Michie, Eds., Edinburgh U. Press, Edinburgh, 1970, pp. 79-98.
15. Manna, Z. and Pnueli, A. Formalization of Properties of Functional Programs. J. ACM 17, 3 (1970), 555-569.
16. McCarthy, J. Towards a mathematical science of computation. Proc. ifip Cong. 1962, North-Holland Pub. Co., Amsterdam.
17. McCarthy, J. A Basis for a Mathematical Theory of Computation. In Computer Programming and Formal Systems, Braffort and Hirshberg, Eds., North Holland Pub. Co., Amsterdam, 1963.
18. McCarthy, J. Predicate calculus with “undefined” as a truth-value. Memo 1, Stanford Artificial Intelligence Proj. Stanford U., 1963.
19. Mendelson, E. Introduction to Mathematical Logic. Van Nostrand, Princeton, N. J., 1964.
20. Morris, J. B. E-resolution: extension of resolution to include the equality relation. Proc. International Joint Conf. on Artificial Intelligence, Washington, D. C., 1969.
21. Park, D. Fixpoint induction and proofs of program properties. In Machine Intelligence 5. Meltzer and Michie, Eds., Edinburgh U. Press, Edinburgh, pp. 59-78.
22. Patterson, M. S. and Hewitt, C. E. Comparative Schematology, Part 1. Artificial Intel. Memo No. 201, mit, 1970.
23. Robinson, J. A machine-oriented logic based on the resolution principle. J. ACM 12, 1 (Jan. 1965), 23-41.
24. Scott, D. A type-theoretical alternative to CUCH, ISWIM, OWHY. Unpublished memo, 1969.
25. Simon, H. Experiments with a heuristic compiler. J. ACM, 10, 4 (Oct. 1963), 493-506.
26. Slagle, J. Experiments with a deductive question-answering program. Comm. ACM 8, 12 (Dec. 1965), 792-798.
27. Strong, H. R. Translating recursion equations into flow charts. Second Ann. acm Symp. on Theory of Computing, Northampton, Mass., 1970.
28. Waldinger, R. J. Constructing programs automatically using theorem proving. Ph.D. Thesis, 1969, Carnegie-Mellon U., Pittsburgh, Pa.
29. Waldinger, R. J. and Lee, R. C. T. PROW: a step toward automatic program writing. Proc. International Joint Conf. on Artificial Intelligence, Washington, D.C., 1969.