### Abstract

In this submission array-based binary minimum heaps are formalized. The correctness of the following heap operations is proved: insert, get-min, delete-min and make-heap. These are then used to verify an in-place 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.

### License

BSD License

### Topics

- Computer science/Data structures
- Computer science/Algorithms

### Session IMP2_Binary_Heap

- IMP2_Binary_Heap

### Depends on

- IMP2 – Simple Program Verification in Isabelle/HOL

## Cite

×

IMP2_Binary_Heap-AFP

    @article{IMP2_Binary_Heap-AFP,
      author  = {Simon Griebel},
      title   = {Binary Heaps for IMP2},
      journal = {Archive of Formal Proofs},
      month   = {June},
      year    = {2019},
      note    = {\url{https://isa-afp.org/entries/IMP2_Binary_Heap.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 13, 2019 : Isabelle2019