Deductive synthesis of sorting programs

  • Jonathan Traugott
Deductive Databases, Planning, Synthesis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 230)


Deductive Approach Deduction Rule Final Program Program Synthesis Equality Match 
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.

Unable to display preview. Download preview PDF.


  1. [Br]
    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. [CD]
    Clark, Darlington (1979). Algorithm classification through synthesis. The Computer Journal, Vol. 23, Number 1.Google Scholar
  3. [Da]
    Darlington (1978) A synthesis of several sort programs. Acta Informatica, Vol 11 No. 1.Google Scholar
  4. [Fo]
    Follet (1981). Automatic program synthesis. Ph.D. Dissertation. Computer Science Department, University of New South Wales.Google Scholar
  5. [GB]
    Green, Barstow (1977). On program synthesis knowledge. Stanford AI memo. November 1977.Google Scholar
  6. [La]
    Laaser (1979). Synthesis of recursive programs. Ph.D. Dissertation. Department of Computer Science, Stanford University.Google Scholar
  7. [Mu]
    Murray (1978). A proof procedure for non-clausal first-order-logic. Technical Report, Syracuse University.Google Scholar
  8. [MW1]
    Manna, Waldinger(1980). A deductive approach to program synthesis. ACM Transactions on Programming Languages and Systems, Vol. 2, No 1.Google Scholar
  9. [MW2]
    Manna, Waldinger (1977). Studies in Automatic Programming Logic. New York: North Holland.Google Scholar
  10. [MW3]
    Manna, Waldinger (1986). Special relations in automated deduction. Journal of the ACM January 1986.Google Scholar
  11. [Sm]
    Smith (1985). Top-down synthesis of simple divide-and-conquer algorithms. Artificial Intelligence, 1985.Google Scholar
  12. [Wa]
    Waldinger (1975). Achieving several goals simultaneously. Technical Note 107, SRI project 2245. July 1975.Google Scholar
  13. [Wal]
    Walther (1984). A mechanical solution of Schubert's Steamroller by many-sorted resolution. Technical Note, Institut für Informatik, Universität Karlsruhe.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Jonathan Traugott
    • 1
  1. 1.Computer Science DepartmentStanford UniversityUSA

Personalised recommendations