A Characterization of Binary Decision Diagrams
暂无分享,去创建一个
[1] Erik Meineche Schmidt,et al. The Complexity of Equivalence and Containment for Free Single Variable Program Schemes , 1978, ICALP.
[2] Randal E. Bryant,et al. Symbolic Verification of MOS Circuits , 1985 .
[3] Sreejit Chakravarty. A testable realization of CMOS combinational circuits , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.
[4] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.
[5] Ingo Wegener,et al. Time-Space Trade-offs for Branching Programs , 1986, J. Comput. Syst. Sci..
[6] Magdy S. Abadir,et al. Functional Test Generation for Digital Circuits Described Using Binary Decision Diagrams , 1986, IEEE Transactions on Computers.
[7] Kurt Keutzer,et al. Testability properties of multilevel logic networks derived from binary decision diagrams , 1991 .
[8] Robert K. Brayton,et al. Implicit state enumeration of finite state machines using BDD's , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[9] Masahiro Fujita,et al. Multi-level logic optimization using binary decision diagrams , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[10] Harry B. Hunt,et al. Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report) , 1986, STACS.
[11] Eduard Cerny,et al. Simulation of MOS Circuits by Decision Diagrams , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[12] Edmund M. Clarke,et al. Sequential circuit verification using symbolic model checking , 1991, DAC '90.
[13] 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.
[14] 藤田 昌宏,et al. Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams , 1988 .
[15] Sheldon B. Akers,et al. Binary Decision Diagrams , 1978, IEEE Transactions on Computers.
[16] Randal E. Bryant,et al. Symbolic Manipulation of Boolean Functions Using a Graphical Representation , 1985, 22nd ACM/IEEE Design Automation Conference.
[17] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[18] Manuel Blum,et al. Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time , 1980, Inf. Process. Lett..
[19] Alfred V. Aho,et al. Principles of Compiler Design , 1977 .
[20] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[21] Hideo Fujiwara,et al. The Complexity of Fault Detection Problems for Combinational Logic Circuits , 1982, IEEE Transactions on Computers.
[22] C. L. Berman. Ordered binary decision diagrams and circuit structure , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.
[23] Jerry R. Burch,et al. Using bdds to verify multipliers , 1991, 28th ACM/IEEE Design Automation Conference.
[24] C. Y. Lee. Representation of switching circuits by binary-decision programs , 1959 .
[25] Masahiro Fujita,et al. Boolean resubstitution with permissible functions and binary decision diagrams , 1991, DAC '90.
[26] Masahiro Fujita,et al. Automatic and semi-automatic verification of switch-level circuits with temporal logic and binary decision diagrams , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[27] 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.
[28] 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.
[29] Harry B. Hunt,et al. On Computing Signal Probability and Detection Probability of Stuck-at Faults , 1990, IEEE Trans. Computers.