A Verified Implementation of B+-Trees in Isabelle/HOL

Niels Mündler and Tobias Nipkow

In this paper we present the verification of an imperative implementation of the ubiquitous B+-tree data structure in the interactive theorem prover Isabelle/HOL. The implementation supports membership test, insertion and range queries with efficient binary search for intra-node navigation. The imperative implementation is verified in two steps: an abstract set interface is refined to an executable but inefficient purely functional implementation which is further refined to the efficient imperative implementation.

arxiv Spinger


author = {Niels Mündler and Tobias Nipkow},
title = {A Verified Implementation of B+-Trees in Isabelle/HOL},
booktitle = {Intl. Colloquium on Theoretical Aspects of Computing (ICTAC 2022)},
editor = {},
publisher = {Springer},
series = {LNCS},
volume = {},
pages = {},
year =2022
Isabelle theories in the Archive of Formal Proofs