Algorithmic methods in automatic programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 203)
- 107 Downloads
KeywordsRecursive Call Original Specification Input List Program Synthesis Synthesis Methodology
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- A. Barr and E.A. Feigenbaum (Editors), Handbook of Artificial Intelligence, Vol. 2, William Kaufmann, Inc., Los Altos, 1982.Google Scholar
- W. Bibel and K.M. Hörnig, “LOPS, A System based on a strategical approach to program synthesis”, in Automatic Program Construction Techniques (Eds. A. Biermann, G. Guiho, Y. Kodratoff), 69–89, 1984.Google Scholar
- A.W. Biermann, “Approaches to automatic programming,”, in Advances in Computers 15, Academic Press, New York, 1–63, 1976.Google Scholar
- A.W. Biermann, “Automatic Programming: A Tutorial on Formal Methodologies”, Journal of Symbolic Computation, Vol. 1, No. 2, 1985.Google Scholar
- A.W. Biermann and G. Guiho (Editors), Computer Program Synthesis Methodologies, D. Reidel Publishing Co., 1983.Google Scholar
- A.W. Biermann, G. Guiho, and Y. Kodratoff (Editors), Automatic Program Construction Techniques, Macmillan Publishing Co., 1984.Google Scholar
- M. Broy, “Program construction by transformations: a family tree of sorting programs”, in Computer Program Synthesis Methodologies (Editors: A. Biermann and G. Guiho), 1–49, 1983.Google Scholar
- Z. Manna and R. Waldinger, “Synthesis: dreams ⇒ programs”, IEEE Transactions on Software Engineering SE-5, 294–328, 1979.Google Scholar
- D.R. Smith, “Top-down synthesis of simple divide and conquer algorithms”, to appear in Artificial Intelligence, 1985.Google Scholar
© Springer-Verlag Berlin Heidelberg 1985