Border-Block Triangular Form and Conjunction Schedule in Image Computation
暂无分享,去创建一个
[1] Edmund M. Clarke,et al. Representing circuits more efficiently in symbolic model checking , 1991, 28th ACM/IEEE Design Automation Conference.
[2] In-Ho Moon,et al. Efficient reachability algorithms in symbolic model checking , 2000 .
[3] 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.
[4] R. Willoughby. Sparse matrices and their applications , 1972 .
[5] Eli Hellerman,et al. The Partitioned Preassigned Pivot Procedure (P4) , 1972 .
[6] Ilan Beer,et al. Efficient Model Checking by Automated Ordering of Transition Relation Partitions , 1994, CAV.
[7] Tiziano Villa,et al. VIS: A System for Verification and Synthesis , 1996, CAV.
[8] N. S. Mendelsohn,et al. Two Algorithms for Bipartite Graphs , 1963 .
[9] F. Somenzi,et al. To split or to conjoin: the question in image computation , 2000, Proceedings 37th Design Automation Conference.
[10] Fabio Somenzi,et al. Variable ordering and selection of FSM traversal , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.
[11] Kenneth L. McMillan,et al. Symbolic model checking , 1992 .
[12] Seh-Woong Jeong,et al. ATPG aspects of FSM verification , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[13] Robert K. Brayton,et al. Early quantification and partitioned transition relations , 1996, Proceedings International Conference on Computer Design. VLSI in Computers and Processors.
[14] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.