| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Binary Search Trees
| Title: | Binary Search Trees |
| Author: | Viktor Kuncak |
| Submission date: | 2004-04-05 |
| Abstract: | The correctness is shown of binary search tree operations (lookup, insert and remove) implementing a set. Two versions are given, for both structured and linear (tactic-style) proofs. An implementation of integer-indexed maps is also verified. |
| BibTeX: |
@article{BinarySearchTree-AFP,
author = {Viktor Kuncak},
title = {Binary Search Trees},
journal = {Archive of Formal Proofs},
month = apr,
year = 2004,
note = {\url{http://isa-afp.org/entries/BinarySearchTree.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |