ACM Home Page
Please provide us with feedback. Feedback
A Deductive Approach to Program Synthesis
Full text PdfPdf (1.59 MB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 2 ,  Issue 1  (January 1980) table of contents
Pages: 90 - 121  
Year of Publication: 1980
ISSN:0164-0925
Authors
Zohar Manna  Department of Computer Science, Stanford University, Stanford, CA
Richard Waldinger  Artificial Intelligence Center, SRI International, 333 Ravenswood Ave., Menlo Park, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 103,   Citation Count: 57
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/357084.357090
What is a DOI?

ABSTRACT

Program synthesis is the systematic derivation of a program from a given specification. A deductive approach to program synthesis is presented for the construction of recursive programs. This approach regards program synthesis as a theorem-proving task and relies on a theorem-proving method that combines the features of transformation rules, unification, and mathematical induction within a single framework.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BLEDSOE, W.W. Non-resolution theorem proving. Artif. Intell. J. 9, (1977), 1-35.
2
3
 
4
DARLINGTON, J.L. Automatic theorem proving with equality substitutions and mathematical induction. Machine Intell. 3 (Edinburgh, Scotland) (1968), 113-127.
 
5
GREEN, C.C. Application of theorem proving to problem solving, in Proc. Int. Joint Conf. on Artificial Intelligence (Washington D.C., May 1969), 219-239.
 
6
HEWiTT, C. Description and theoretical analysis (using schemata) of PLANNER: A language for proving theorems and manipulating models in a robot. Ph.D. Diss., M.I.T., Cambridge, Mass., 1971.
 
7
MANNA, Z., AND WALDiNGER, R. Synthesis: dreams ~ programs, iEEE Trans. Sofiw. Eng. SE-5, 4 (July 1979), 294-328.
 
8
MURRAY, N. A proof procedure for non-clausal fwst-order logic. Tech. Rep. Syracuse Univ., Syracuse, N.Y., 1978.
9
 
10
NiLSSON, N.J. A production system for automatic deduction. Machine Intell. 9, Ellis Horwood, Chichester, England, 1979.
 
11
12
 
13
WALDINGER, R.J., A~o LEE, R.C.T. PROW: A step toward automatic program writing. In Proc. Int. Joint Conf. on Artificial Intelligence (Washington D.C., May 1969), pp. 241-252.
 
14
WILKI~S, D. QUEST--A non-clausal theorem proving system. M.Sc. Th., Univ. of Essex, England, 1973.

CITED BY  57

Collaborative Colleagues:
Zohar Manna: colleagues
Richard Waldinger: colleagues