Skip to main content
SpringerLink
Log in

The use of Hoare's method of program verfification for the quicksort algorithm

Erfahrungen beim Quicksort Algorithmus mit der Hoareschen Methode der Programmverifikation

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Using the Quicksort Algortihm, given by van Emden, an analysis is made how Hoare's method of program verification can be applied to already existing programs. Changes to these programs become necessary to adopt them to the proving method and to the existing axioms. The interdependencies between these changes and the verification method are discussed and conclusions are draw about the applicability of Hoare's Methods for proving already existing programs.

Zusammenfassung

Die vorliegende Arbeit analysiert die Erfahrungen, die bei der Durchführung formaler Korrektheitsbeweise an schon exsiterenden Programmen gemacht wurden. Mit Hilfe der Hoareschen Methode der Programmverfikation wurde der von an Emden angegebene Quicksort Algorithmus als richtig bewiesen. Dafür was es jedoch notwendig, eine Reihe von Veränderungen an dem Algorithmus vorzunehmen, um ihn an das Beweisverfahren und die existierenden Axiome anzupassen. Die gegenseitige Einflußnahme der Veränderungen und des Beweisverfahrens werden analysiert und Schlüse über die Verwendbarkeit des Hoareschen Verifikationsverfahrens für existierende Programme werden gezogen.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Clint, M., Hoare, C. A. R.: Program Proving: Jumps and Functions. Acta Informatica1, 214–224 (1972).

    Google Scholar 

  2. van Emden, M. H.: Increasing the Efficiency of Quicksort. CACM13, 563–567 (1970).

    Google Scholar 

  3. van Emden, M. H.: Algorithm 402: Increasing the Efficiency of Quicksort. CACM13, 693–694 (1970).

    Google Scholar 

  4. Foley, M., Haore, C. A. R.: Proof of a Recursive Program: Quicksort. The Computer Journal14, 391–395 (1971).

    Google Scholar 

  5. Hoare, C. A. R.: An axiomatic Basis for Computer Programming. CACM12, 576–580, 583 (1969).

    Google Scholar 

  6. Hoare, C. A. R.: Procedures and Parameters: An Axiomatic Approach. Symposium on the Semantics of Algorithmic Languages (Engeler, E., ed.), pp. 102–116. (Lecture Notes in Mathematics, 188.) Berlin-Heidelberg-New York: Springer 1971.

    Google Scholar 

  7. Hoare, C. A. R.: Proof of a Program: Find. CACM14, 39–45 (1971).

    Google Scholar 

  8. Studer, R.: An Application of Hoare's Method of Program Verification. Master Thesis, Institute of Computer Science, University of Stuttgart, 1974.

Download references

Author information

Authors and Affiliations

  1. University of Stuttgart, D-7000, Stuttgart, Federal Republic of Germany

    E. J. Neuhold & R. Studer

Authors
  1. E. J. Neuhold
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Studer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Neuhold, E.J., Studer, R. The use of Hoare's method of program verfification for the quicksort algorithm. Computing 18, 281–293 (1977). https://doi.org/10.1007/BF02244016

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02244016

Keywords

Search

Navigation