K*BMDs: a new data structure for verification
暂无分享,去创建一个
[1] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.
[2] E.M. Clarke,et al. Hybrid decision diagrams. Overcoming the limitations of MTBDDs and BMDs , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[3] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[4] Andreas Kuehlmann,et al. Formal verification of a PowerPC microprocessor , 1995, Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors.
[5] R. Bryant,et al. Verification of Arithmetic Functions with Binary Moment Diagrams , 1994 .
[6] Xudong Zhao,et al. Word Level Symbolic Model Checking: A New Approach for Verifying Arithmetic Circuits , 1995 .
[7] Masahiro Fujita,et al. On variable ordering of binary decision diagrams for the application of multi-level logic synthesis , 1991, Proceedings of the European Conference on Design Automation..
[8] Albert R. Wang,et al. Logic verification using binary decision diagrams in a logic synthesis environment , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.
[9] A. Kuehlmann,et al. Formal Veri cation of a PowerPC Microprocessor , 1995 .
[10] Rolf Drechsler,et al. Dynamic minimization of OKFDDs , 1995, Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors.
[11] Massoud Pedram,et al. Factored Edge-Valued Binary Decision Diagrams , 1997, Formal Methods Syst. Des..
[12] Shuzo Yajima,et al. Efficient construction of binary moment diagrams for verifying arithmetic circuits , 1995, ICCAD.
[13] Masahiro Fujita,et al. Evaluation and improvement of Boolean comparison method based on binary decision diagrams , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.
[14] Masahiro Fujita,et al. Hybrid decision diagrams , 1995, ICCAD.
[15] Rolf Drechsler,et al. Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions , 1995, EDTC '95.
[16] Shuzo Yajima,et al. Efficient construction of binary moment diagrams for verifying arithmetic circuits , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[17] Randal E. Bryant,et al. On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication , 1991, IEEE Trans. Computers.
[18] Sarma Sastry,et al. Edge-valued binary decision for multi-level hierarchical verification , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.
[19] Yung-Te Lai,et al. Edge-valued binary decision diagrams for multi-level hierarchical verification , 1992, DAC '92.
[20] R. Rudell. Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD 1993.
[21] R. Drechsler,et al. On variable ordering and decomposition type choice in OKFDDs , 1995, Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair.
[22] Rolf Drechsler,et al. How many decomposition types do we need? [decision diagrams] , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.
[23] 藤田 昌宏,et al. Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams , 1988 .
[24] R. Rudell. Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).
[25] Randal E. Bryant,et al. Verification of Arithmetic Circuits with Binary Moment Diagrams , 1995, 32nd Design Automation Conference.
[26] Bernd Becker,et al. How many Decomposition Types do we need , 1995 .
[27] Rolf Drechsler,et al. Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams , 1994, 31st Design Automation Conference.