1. L. Arditi. *BMDs can delay the use of theorem proving for verifying arithmetic assembly instructions. Formal Methods in Computer-Aided Design, pages 34–48, November 1996.
2. B. Becker and R. Drechsler. How many decomposition types do we need? European Design and Test Conference, pages 438–443, 1995.
3. B. Becker, R. Drechsler, and R. Enders. On the representational power of bit-level and word-level decision diagrams. Asian and South Pacific Design Automation Conference, 1997.
4. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C(35): 677–691, August 1986.
5. R. E. Bryant and Y.-A. Chen. Verification of arithmethic functions with binary moment diagrams. Technical Report CMU-CS-94–160, Carnegie Mellon University, May 1994.