Skip to main content
SpringerLink
Log in

Deductive synthesis of sorting programs

  • Deductive Databases, Planning, Synthesis
  • Conference paper
  • First Online:
8th International Conference on Automated Deduction (CADE 1986)

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

Included in the following conference series:

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.

Bibliography

  1. Broy (1978). A case study in program developement: sorting. Technical Report TUM-INFO-11-78-31-350, Technisische Universität München.

    Google Scholar 

  2. Clark, Darlington (1979). Algorithm classification through synthesis. The Computer Journal, Vol. 23, Number 1.

    Google Scholar 

  3. Darlington (1978) A synthesis of several sort programs. Acta Informatica, Vol 11 No. 1.

    Google Scholar 

  4. Follet (1981). Automatic program synthesis. Ph.D. Dissertation. Computer Science Department, University of New South Wales.

    Google Scholar 

  5. Green, Barstow (1977). On program synthesis knowledge. Stanford AI memo. November 1977.

    Google Scholar 

  6. Laaser (1979). Synthesis of recursive programs. Ph.D. Dissertation. Department of Computer Science, Stanford University.

    Google Scholar 

  7. Murray (1978). A proof procedure for non-clausal first-order-logic. Technical Report, Syracuse University.

    Google Scholar 

  8. Manna, Waldinger(1980). A deductive approach to program synthesis. ACM Transactions on Programming Languages and Systems, Vol. 2, No 1.

    Google Scholar 

  9. Manna, Waldinger (1977). Studies in Automatic Programming Logic. New York: North Holland.

    Google Scholar 

  10. Manna, Waldinger (1986). Special relations in automated deduction. Journal of the ACM January 1986.

    Google Scholar 

  11. Smith (1985). Top-down synthesis of simple divide-and-conquer algorithms. Artificial Intelligence, 1985.

    Google Scholar 

  12. Waldinger (1975). Achieving several goals simultaneously. Technical Note 107, SRI project 2245. July 1975.

    Google Scholar 

  13. Walther (1984). A mechanical solution of Schubert's Steamroller by many-sorted resolution. Technical Note, Institut für Informatik, Universität Karlsruhe.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Stanford University, USA

    Jonathan Traugott

Authors
  1. Jonathan Traugott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jörg H. Siekmann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Traugott, J. (1986). Deductive synthesis of sorting programs. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_127

Download citation

  • DOI: https://doi.org/10.1007/3-540-16780-3_127

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16780-8

  • Online ISBN: 978-3-540-39861-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation