Author:
Mahzoon Alireza,Große Daniel,Drechsler Rolf
Publisher
Springer International Publishing
Reference26 articles.
1. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677–691 (1986)
2. Scholl, C., Becker, B., Weis, T.: On WLCDs and the complexity of word-level decision diagrams – a lower bound for division. Formal Methods Syst. Des. Int. J. 20(3), 311 (2002)
3. Hamaguchi, K., Morita, A., Yajima, S.: Efficient construction of binary moment diagrams for verifying arithmetic circuits. In: International Conference on Computer-Aided Design, pp. 78–82 (1995)
4. Keim, M., Drechsler, R., Becker, B., Martin, M., Molitor, P.: Polynomial formal verification of multipliers. Formal Methods Syst. Des. 22(1), 39–58 (2003)
5. Drechsler, R.: Formal Verification of Circuits. Kluwer Academic Publishers, New York (2000)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献