| A Deductive Approach to Program Synthesis |
| Full text |
Pdf
(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 |
|
| Bibliometrics |
Downloads (6 Weeks): 9, Downloads (12 Months): 90, Citation Count: 57
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yonathan Malachi , Zohar Manna , Richard Waldinger, TABLOG: The deductive-tableau programming language, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.323-330, August 06-08, 1984, Austin, Texas, United States
|
|
|
Yanhong A. Liu , Scott D. Stoller , Tim Teitelbaum, Discovering auxiliary information for incremental computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.157-170, January 21-24, 1996, St. Petersburg Beach, Florida, United States
|
|
|
|
|
|
Tadashi Kanamori , Hiroshi Fujita , Hirohisa Seki , Kenji Horiuchi , Machi Maeji, Argus/V: a system for verification of Prolog programs, Proceedings of 1986 ACM Fall joint computer conference, p.994-999, November 1986, Dallas, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
M. Bauer , S. Biundo , D. Dengler , J. Koehler , G. Paul, PHI: a logic-based tool for intelligent help systems, Proceedings of the 13th international joint conference on Artifical intelligence, p.460-466, August 28-September 03, 1993, Chambery, France
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|