A Verified Implementation of B+-Trees in Isabelle/HOL
Logic in Computer Science
2022-08-22 v1 Data Structures and Algorithms
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.
Cite
@article{arxiv.2208.09066,
title = {A Verified Implementation of B+-Trees in Isabelle/HOL},
author = {Niels Mündler and Tobias Nipkow},
journal= {arXiv preprint arXiv:2208.09066},
year = {2022}
}
Comments
Submitted at ICTAC 2022