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

Niels Mündler, Tobias Nipkow

Abstract

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.
BibTeX
@inproceedings{mundler2022verified,
  author = {Niels Mündler and Tobias Nipkow},
  title = {{A Verified Implementation of B+-Trees in Isabelle/HOL}},
  booktitle = {ICTAC},
  year = {2022},
  doi = {10.1007/978-3-031-17715-6\_21},
}
Figure