Abstract: 
In this submission arraybased binary minimum heaps are formalized.
The correctness of the following heap operations is proved: insert,
getmin, deletemin and makeheap. These are then used to verify an
inplace heapsort. The formalization is based on IMP2, an imperative
program verification framework implemented in Isabelle/HOL. The
verified heap functions are iterative versions of the partly recursive
functions found in "Algorithms and Data Structures – The Basic
Toolbox" by K. Mehlhorn and P. Sanders and "Introduction to
Algorithms" by T. H. Cormen, C. E. Leiserson, R. L. Rivest and C.
Stein. 
BibTeX: 
@article{IMP2_Binary_HeapAFP,
author = {Simon Griebel},
title = {Binary Heaps for IMP2},
journal = {Archive of Formal Proofs},
month = jun,
year = 2019,
note = {\url{https://isaafp.org/entries/IMP2_Binary_Heap.html},
Formal proof development},
ISSN = {2150914x},
}
