Reachability analysis using partitioned-ROBDDs
暂无分享,去创建一个
[1] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[2] Carl Pixley. Introduction to a Computational Theory and Implementation of Sequential Hardware Equivalence , 1990, CAV.
[3] Carl Pixley. A Computation Theory and Implementation of Sequential Hardware Equivalence , 1990, CAV.
[4] 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.
[5] Edmund M. Clarke,et al. Representing circuits more efficiently in symbolic model checking , 1991, 28th ACM/IEEE Design Automation Conference.
[6] Edmund M. Clarke,et al. Symbolic Model Checking with Partitioned Transistion Relations , 1991, VLSI.
[7] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[8] Wolfgang Rosenstiel,et al. Multilevel logic synthesis based on functional decision diagrams , 1992, [1992] Proceedings The European Conference on Design Automation.
[9] Jawahar Jain. On analysis of Boolean functions , 1993 .
[10] Shin-ichi Minato,et al. Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.
[11] Christoph Meinel,et al. Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's , 1994, IEEE Trans. Computers.
[12] Gianpiero Cabodi,et al. Auxiliary Variables for Extending Symbolic Traversal Techniques to Data Paths , 1994, 31st Design Automation Conference.
[13] Robert K. Brayton,et al. Heuristic Algorithms for Early Quantification and Partial , 1994 .
[14] Rolf Drechsler,et al. Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams , 1994, 31st Design Automation Conference.
[15] F. Somenzi,et al. High-density reachability analysis , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[16] Jochen Bern,et al. Efficient OBDD-Based Boolean Manipulation in CAD Beyond Current Limits , 1995, 32nd Design Automation Conference.
[17] Ingo Wegener,et al. Graph Driven BDDs - A New Data Structure for Boolean Functions , 1995, Theor. Comput. Sci..
[18] Robert K. Brayton,et al. Decomposition Techniques for Efficient ROBDD Construction , 1996, FMCAD.
[19] Sérgio Vale Aguiar Campos,et al. Symbolic Model Checking , 1993, CAV.
[20] A. Sangiovanni-Vincentelli,et al. Partitioned ROBDDs—a compact, canonical and efficiently manipulable representation for Boolean functions , 1996, ICCAD 1996.
[21] Kenneth L. McMillan,et al. A Conjunctively Decomposed Boolean Representation for Symbolic Model Checking , 1996, CAV.
[22] G. Cabodi,et al. Improved reachability analysis of large finite state machines , 1996, ICCAD 1996.
[23] Luciano Lavagno,et al. Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits , 1997, DAC.
[24] Gianpiero Cabodi,et al. Symbolic FSM traversals based on the transition relation , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[25] Jacob A. Abraham,et al. Indexed BDDs: Algorithmic Advances in Techniques to Represent and Verify Boolean Functions , 1997, IEEE Trans. Computers.
[26] Stephan Waack. On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams , 1997, STACS.
[27] Beate Bollig,et al. Hierarchy Theorems for kOBDDs and kIBDDs , 1998, Theor. Comput. Sci..