Commit 0aef7f48 authored by Gerwin Klein's avatar Gerwin Klein

website update

parent 90fe8dfd1261
......@@ -117,7 +117,7 @@ MathJax = {
<td class="abstract mathjax_process">
In this work, we use the interactive theorem prover Isabelle/HOL to
verify an imperative implementation of the classical B-tree data
structure invented by Bauer and McCreight [ACM 1970]. The
structure invented by Bayer and McCreight [ACM 1970]. The
implementation supports set membership and insertion queries with
efficient binary search for intra-node navigation. This is
accomplished by first specifying the structure abstractly in the
......
......@@ -19,7 +19,7 @@
<description>
In this work, we use the interactive theorem prover Isabelle/HOL to
verify an imperative implementation of the classical B-tree data
structure invented by Bauer and McCreight [ACM 1970]. The
structure invented by Bayer and McCreight [ACM 1970]. The
implementation supports set membership and insertion queries with
efficient binary search for intra-node navigation. This is
accomplished by first specifying the structure abstractly in the
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment