| ||||
| ||||
![]() Title:A Verified Implementation of B-Trees in Isabelle/HOL Conference:Isabelle 2022 Tags:Functional Data Structures, Refinement, Separation Logic and Verification 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. A Verified Implementation of B-Trees in Isabelle/HOL ![]() A Verified Implementation of B-Trees in Isabelle/HOL | ||||
Copyright © 2002 – 2025 EasyChair |