Modular verification of multipliers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1166, Issue , 1996, Pages 49-63

  Ravi, Kavita ^a   Pardo, Abelardo ^a   Hachtel, Gary D ^a   Somenzi, Fabio ^a  

^a University of Colorado at Boulder   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; LOGIC CIRCUITS; RECONFIGURABLE HARDWARE;

ARITHMETIC CIRCUIT; DECISION DIAGRAM; MODULAR ARITHMETIC; MODULAR VERIFICATION;

FORMAL METHODS;

EID: 84957679160     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0031799     Document Type: Conference Paper

References (21)

1. P. Ashar, A. Ghosh, and S. Devadas. Boolean satisfiability and equivalence checking using general binary decision diagrams. In Proceedings of the International Conference on Computer Design, pages 259-264, Cambridge, MA, October 1991.
2. R. I. Bahar, E. A. Frohm, C. M. Gaona, G. D. Haehtel, E. Maeii, A. Pardo, and F. Somenzi. Algebraic decision diagrams and their applications. In Proceedings of the International Conference on Computer-Aided Design, pages 188-191, Santa Clara, CA, November 1993.
3. K. S. Brace, R. L. Rudell, and R. E. Bryant. Efficient implementation of a BDD package, In Proceedings of the 27th Design Automation Conference, pages 40-45, Orlando, FL, June 1990.
4. D. Brand. Verification of large synthesized designs. In Proceedings of the International Conference on Computer-Aided Design, pages 534-537, Santa Clara, CA, November 1993.
5. R. K. Brayton et al. VIS: A system for verification and synthesis. Technical Report UCB/ERL M95/104, Electronics Research Lab, Univ. of California, December 1995.
6. R. Bryant and Y.-A. Chen. Verification of arithmetic circuits with binary moment diagrams. In Proceedings of the Design Automation Conference, pages 535-541, San Francisco, CA, June 1995.
7. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
8. R. E. Bryant. On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication. IEEE Transactions on Computers, 40(2):205-213, February 1991.
9. J. R. Butch. Using BDDs to verify multipliers. In Proceedings of the Design Automation Conference, pages 408-412, San Francisco, CA, June 1991.
10. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. In Proceedings of the t9th ACM Symposium on Prcinciples of Programming Languages, January 1992.
11. E. M. Clarke, K. L. McMillan, X. Zhao, M. Fujita, and J. C.-Y. Yang. Spectral transforms for large boolean functions with applications to technology mapping. In Proceedings of the Design Automation Conference, pages 54-60, Dallas, TX, June 1993.
12. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. An Introduction to Algorithms. McGraw-Hill, New York, 1990.
13. K. Hamaguchi, A. Morita, and S. Yajima. Efficient construction of binary moment diagrams for verifying arithmetic circuits. In Proceedings of the International Conference on Computer-Aided Design, pages 78-82, San Jose, CA, November 1995.
14. J. Jain, M. Abadir, J. Bitner, D. S. Fussell, and J. A. Abraham. IBDDs: An efficient functional representation for digital circuits. In Proceedings of the European Conference on Design Automation, pages 440-446, Brussels, Belgium, March 1992.
15. J. Jain, R. Mukherjee, and M. Fujita. Advanced verification techniques based on learning. In Proceedings of the Design Automation Conference, pages 420-426, San Francisco, CA, June 1995.
16. U. Kebshull, E. Schubert, and W. Rosenstiel. Multilevel logic synthesis based on functional decision diagrams. In Proceedings of the European Conference on Design Automation, pages 43-47, Brussels, March 1992.
17. S. Kimura. Residue BDD and its application to the verification of arithmetic circuits. In Proceedings of the Design Automation Conference, pages 542-545, San Francisco, CA, June 1995.
18. Y.-T. Lai and S. Sastry. Edge-valued binary decision diagrams for multilevel hierarchical verification. In Proceedings of the Design Automation Conference, pages 608-613, Anaheim, CA, June 1992.
19. S.-I. Minato. Zero-suppressed BDDs for set manipulation in combinatorial problems. In Proceedings of the Design Automation Conference, pages 272-277, Dallas, TX, June 1993.
20. B. Plessier, G. Hachtel, and F. Somenzi. Extended BDDs: Trading off canonicity for structure in verification algorithms. Journal of Formal Methods in System Design, 4(2):167-185, February 1994.
21. S. M. Reddy, W. Kunz, and D. K. Pradhan. Novel verification framework combining structural and OBDD methods in a synthesis environment. In Proceedings of the Design Automation Conference, pages 414-419, San Francisco, CA, June 1995.