Algorithms for Reduced Ordered Binary Decision Diagrams

 

Title: Algorithms for Reduced Ordered Binary Decision Diagrams
Authors: Julius Michaelis, Maximilian Haslbeck, Peter Lammich and Lars Hupel
Submission date: 2016-04-27
Abstract: We present a verified and executable implementation of ROBDDs in Isabelle/HOL. Our implementation relates pointer-based computation in the Heap monad to operations on an abstract definition of boolean functions. Internally, we implemented the if-then-else combinator in a recursive fashion, following the Shannon decomposition of the argument functions. The implementation mixes and adapts known techniques and is built with efficiency in mind.
BibTeX:
@article{ROBDD-AFP,
  author  = {Julius Michaelis and Maximilian Haslbeck and Peter Lammich and Lars Hupel},
  title   = {Algorithms for Reduced Ordered Binary Decision Diagrams},
  journal = {Archive of Formal Proofs},
  month   = apr,
  year    = 2016,
  note    = {\url{http://isa-afp.org/entries/ROBDD.shtml},
            Formal proof development},
  ISSN    = {2150-914x},
}
License: BSD License
Depends on: Automatic_Refinement, Separation_Logic_Imperative_HOL