Balanced trees with removals: An exercise in rewriting and proof

DOI10.1016/0167-6423(92)90009-ZzbMath0769.68032MaRDI QIDQ1193748

C. M. P. Reade

Publication date: 27 September 1992

Published in: Science of Computer Programming (Search for Journal in Brave)

zbMATH Keywords

correctnessrewritinginsertion algorithmbalanced treesequational algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Data structures (68P05)

Related Items (3)

An assertional proof of red-black trees using Dafny ⋮ Automatic Functional Correctness Proofs for Functional Search Trees ⋮ Purely Functional 1-2 Brother Trees

This page was built for publication: Balanced trees with removals: An exercise in rewriting and proof