Skip to main content
SpringerLink
Log in

Algorithmic methods in automatic programming

  • Conference paper
  • First Online:
EUROCAL '85 (EUROCAL 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 203))

Included in the following conference series:

  • 126 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 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 

  • R.M. Burstall and J. Darlington, “A transformation system for developing recursive programs”, Journal of the ACM 24, 44–67, 1977.

    Article  Google Scholar 

  • S.L. Gerhart, “Proof theory of partial correctness verification systems”, SIAM Journal of Computing 5, 355–377, 1976.

    Article  Google Scholar 

  • Z. Manna and R. Waldinger, “Synthesis: dreams ⇒ programs”, IEEE Transactions on Software Engineering SE-5, 294–328, 1979.

    Google Scholar 

  • Z. Manna and R. Waldinger, “A deductive approach to program synthesis”, ACM Transactions on Programming Languages and Systems 2, 90–121, 1980.

    Article  Google Scholar 

  • D.R. Smith, “Top-down synthesis of simple divide and conquer algorithms”, to appear in Artificial Intelligence, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Duke University, 27706, Durham, NC, USA

    Alan W. Biermann

Authors
  1. Alan W. Biermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bruno Buchberger

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Biermann, A.W. (1985). Algorithmic methods in automatic programming. In: Buchberger, B. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15983-5_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-15983-5_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15983-4

  • Online ISBN: 978-3-540-39684-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation