### 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.

### License

BSD License

### Topics

- Computer science/Algorithms

### Session Imperative_Insertion_Sort

- Imperative_Loops
- Imperative_Insertion_Sort

## Cite

×

Imperative_Insertion_Sort-AFP

    @article{Imperative_Insertion_Sort-AFP,
      author  = {Christian Sternagel},
      title   = {Imperative Insertion Sort},
      journal = {Archive of Formal Proofs},
      month   = {September},
      year    = {2014},
      note    = {\url{https://isa-afp.org/entries/Imperative_Insertion_Sort.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 18, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Feb 22, 2016 : Isabelle2016
- May 27, 2015 : Isabelle2015
- Sep 25, 2014 : Isabelle2014