Witnesses: Recursive tree 3 (magic wand)

This file demonstrates how a magic wand can be used to prove that the deletion of a node from a binary search tree is sound.

General information

ID171
Articlenone
Back-endSilicon
LanguageJava
FeaturesMagic wands, Sequences, Trees, Witnesses
Sources
Path to example filewitnesses/TreeWandSilver.java
Date2017-06-21

Statistical information

Lines of code101 lines (comments not included)
Lines of specification67 lines (66.34% of the total)
Computation time78023 milliseconds

Example code

Note, verification may take a while and has a time-out of 20 seconds.