Imperative Insertion Sort

Christian Sternagel 📧

September 25, 2014

Abstract

The insertion sort algorithm of Cormen et al. (Introduction to Algorithms) is expressed in Imperative HOL and proved to be correct and terminating. For this purpose we also provide a theory about imperative loop constructs with accompanying induction/invariant rules for proving partial and total correctness. Furthermore, the formalized algorithm is fit for code generation.
BSD License

Topics

Theories of Imperative_Insertion_Sort