Journal of Automated Reasoning

, Volume 43, Issue 1, pp 1–18

Proof Pearl: Mechanizing the Textbook Proof of Huffman’s Algorithm

Article

DOI: 10.1007/s10817-009-9116-y

Cite this article as:
Blanchette, J.C. J Autom Reasoning (2009) 43: 1. doi:10.1007/s10817-009-9116-y

Abstract

Huffman’s algorithm is a procedure for constructing a binary tree with minimum weighted path length. Our Isabelle/HOL proof closely follows the sketches found in standard algorithms textbooks, uncovering a few snags in the process. Another distinguishing feature of our formalization is the use of custom induction rules to help Isabelle’s automatic tactics, leading to very short proofs for most of the lemmas.

Keywords

Huffman coding Interactive theorem provers Higher-order logic 

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  1. 1.Institut für InformatikTechnische Universität MünchenMunichGermany

Personalised recommendations