Verification of BDD normalization

  • Authors:
  • Veronika Ortner;Norbert Schirmer

  • Affiliations:
  • Institut für Informatik, Technische Universität München;Institut für Informatik, Technische Universität München

  • Venue:
  • TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present the verification of the normalization of a binary decision diagram (BDD). The normalization follows the original algorithm presented by Bryant in 1986 and transforms an ordered BDD in a reduced, ordered and shared BDD. The verification is based on Hoare logics and is carried out in the theorem prover Isabelle/HOL. The work is both a case study for verification of procedures on a complex pointer structure, as well as interesting on its own, since it is the first proof of functional correctness of the pointer based normalization process we are aware of.