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

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.