• Top
    • Documentation
    • Books
    • Boolean-reasoning
      • Ipasir
      • Aignet
      • Aig
        • Aig-constructors
        • Aig-vars
        • Aig-sat
        • Bddify
          • Aig-substitution
          • Aig-other
          • Aig-semantics
          • Aig-and-count
        • Satlink
        • Truth
        • Ubdds
        • Bdd
        • Faig
        • Bed
        • 4v
      • Projects
      • Debugging
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Aig

    Bddify

    An verified algorithm for converting aigs into ubdds.

    The bddify algorithm can convert AIGs into BDDs. This can be used, for instance, to solve satisfiability problems without reaching out to an external SAT solver.

    The algorithm uses two methods to simplify an input AIG using BDDs of limited size; it repeatedly applies these methods while varying the BDD size limit. One method is similar to dynamic weakening in that it replaces oversized BDDs by a conservative approximation; the other method introduces fresh variables to represent oversized BDDs.

    While we have not documented the algorithm with xdoc, a description of its operation and verification can be found in:

    Sol Swords and Warren A. Hunt, Jr. A Mechanically Verified AIG to BDD Conversion Algorithm. In ITP 2010. Springer LNCS 6172, pages 435-449.

    Slides from the ITP presentation are also available.