article

Free access

Program synthesis by analogy

Authors:

John Wade Ulrich,

Robert MollAuthors Info & Claims

ACM SIGART Bulletin, Issue 64

Pages 22 - 28

https://doi.org/10.1145/872736.806928

Published: 01 August 1977 Publication History

PDF eReader

Abstract

By extending a given analogy, a known program which solves a given problem is converted to a program which solves a different but analogous problem. The domains of the two problems need not be the same but they must be related by an initial specified analogy. There are three features which distinguish the approach. First the analogy formation evolves gradually with the synthesis of the new program. Secondly the formation of the analogy is directed by the correctness proof of the known program. Finally the output of the synthesis process produces a correctness proof for the synthesized program.

References

[1]

Dershowitz, N. and Manna, Z., "The Evolution of Programs: A System for Automatic Program Modification," Stanford Artificial Intelligence Laboratory memo AIM-294, December, 1976.

Digital Library

Google Scholar

[2]

Kling, R.E., "A Paradigm for Reasoning by Analogy," Artificial Intelligence 2, 1971, pp. 147-178.

Crossref

Google Scholar

[3]

Evans, T.G., "A Program for the Solution of Geometric-Analogy Intelligence Test Questions," in Semantic Information Processing, M. Minsky (ed) MIT Press, 1968.

Google Scholar

[4]

Goldstein, I., "Summary of MYCROFT; A System for Understanding Simple Picture Programs," ArtificialIntelligence 6, 1975, pp. 249-288.

Google Scholar

[5]

Green, C. and Barstow, D., "Some Rules for the Automatic Synthesis of Programs," Advance Papers of the Fourth IJCAI, September 1975.

Google Scholar

[6]

Hardy, S., "Synthesis of LISP Functions from Examples," Advance Papers of the Fourth IJCAI, Tbilisi USSR, 1975.

Google Scholar

[7]

Ruth, G., "Intelligent Program Analysis," Artificial Intelligence 7, 1976, pp. 65-85.

Digital Library

Google Scholar

[8]

Waldinger, R. and Manna, Z., "Knowledge and Reasoning in Program Synthesis," Advance Papers of the Fourth IJCAI, Tbilisi USSR, 1975.

Google Scholar

[9]

Geiser, J.R., "Commenting Proofs," Advance Papers of the Fourth IJCAI

Digital Library

Google Scholar

[10]

Sussman, G., "A Computational Model of Skill Acquisition," Doctoral Thesis, MIT, 1973.

Google Scholar

[11]

Manna, Z., Mathematical Theory of Computation, McGraw-Hill, New York, 1974.

Digital Library

Google Scholar

[12]

Manna, Z., and Waldinger, R., "The Automatic Synthesis of Recursive Programs," AIPL Conference Proceedings 1977.

Digital Library

Google Scholar

Cited By

View all

Swan JKrawiec K(2018)Discovering Relational Structure in Program Synthesis Problems with Analogical ReasoningGenetic Programming Theory and Practice XIV10.1007/978-3-319-97088-2_10(149-164)Online publication date: 25-Oct-2018
https://doi.org/10.1007/978-3-319-97088-2_10
Poetschke D(2005)Analogical reasoning for second generation expert systemsAnalogical and Inductive Inference10.1007/3-540-51734-0_67(264-276)Online publication date: 26-May-2005
https://doi.org/10.1007/3-540-51734-0_67
Melis CMelis E(2005)Some considerations about formalization of analogical reasoningAnalogical and Inductive Inference10.1007/3-540-18081-8_89(125-134)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-18081-8_89
Show More Cited By

Index Terms

Program synthesis by analogy
1. Computing methodologies
  1. Machine learning
    1. Learning paradigms
    2. Machine learning approaches
      1. Instance-based learning

Recommendations

Program synthesis by analogy
Proceedings of the 1977 symposium on Artificial intelligence and programming languages

By extending a given analogy, a known program which solves a given problem is converted to a program which solves a different but analogous problem. The domains of the two problems need not be the same but they must be related by an initial specified ...
Guidebook for Teachers for the Basic Preprimer Programme: To Accompany Skip Along and Open the Door
Program synthesis by analogy
Proceedings of the 1977 symposium on Artificial intelligence and programming languages

By extending a given analogy, a known program which solves a given problem is converted to a program which solves a different but analogous problem. The domains of the two problems need not be the same but they must be related by an initial specified ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGART Bulletin Just Accepted

Proceedings of the 1977 symposium on Artificial intelligence and programming languages

August 1977

179 pages

ISSN:0163-5719

DOI:10.1145/872736

Issue’s Table of Contents

Proceedings of the 1977 symposium on Artificial intelligence and programming languages
August 1977
185 pages
ISBN:9781450378741
DOI:10.1145/800228
Chairman:
James Low

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1977

Published in SIGAI , Issue 64

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
376
Total Downloads

Downloads (Last 12 months)101
Downloads (Last 6 weeks)8

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Swan JKrawiec K(2018)Discovering Relational Structure in Program Synthesis Problems with Analogical ReasoningGenetic Programming Theory and Practice XIV10.1007/978-3-319-97088-2_10(149-164)Online publication date: 25-Oct-2018
https://doi.org/10.1007/978-3-319-97088-2_10
Poetschke D(2005)Analogical reasoning for second generation expert systemsAnalogical and Inductive Inference10.1007/3-540-51734-0_67(264-276)Online publication date: 26-May-2005
https://doi.org/10.1007/3-540-51734-0_67
Melis CMelis E(2005)Some considerations about formalization of analogical reasoningAnalogical and Inductive Inference10.1007/3-540-18081-8_89(125-134)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-18081-8_89
Pötschke D(2005)Formalizing analogical reasoningMathematical Methods of Specification and Synthesis of Software Systems '8510.1007/3-540-16444-8_19(215-218)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-16444-8_19
Miriyala KHarandi M(1991)Automatic Derivation of Formal Software Specifications from Informal DescriptionsIEEE Transactions on Software Engineering10.1109/32.9919817:10(1126-1142)Online publication date: 1-Oct-1991
https://dl.acm.org/doi/10.1109/32.99198
Dershowitz N(1985)Program abstraction and instantiationACM Transactions on Programming Languages and Systems10.1145/3916.39867:3(446-477)Online publication date: 1-Jul-1985
https://dl.acm.org/doi/10.1145/3916.3986
Dershowitz NJeffrey SStucki L(1981)The evolution of programsProceedings of the 5th international conference on Software engineering10.5555/800078.802519(79-88)Online publication date: 9-Mar-1981
https://dl.acm.org/doi/10.5555/800078.802519
Moll RUlrich J(1979)The synthesis of programs by analogyProceedings of the 6th international joint conference on Artificial intelligence - Volume 110.5555/1624861.1624995(592-594)Online publication date: 20-Aug-1979
https://dl.acm.org/doi/10.5555/1624861.1624995
Manna ZWaldinger R(1979)SynthesisIEEE Transactions on Software Engineering10.1109/TSE.1979.2341985:4(294-328)Online publication date: 1-Jul-1979
https://dl.acm.org/doi/10.1109/TSE.1979.234198
Manna ZWaldinger R(1978)The Logic of Computer ProgrammingIEEE Transactions on Software Engineering10.1109/TSE.1978.2314994:3(199-229)Online publication date: 1-May-1978
https://dl.acm.org/doi/10.1109/TSE.1978.231499
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations