A genetic approach for conjunction scheduling in symbolic equivalence checking
暂无分享,去创建一个
[1] David R. O'Hallaron,et al. Optimizing model checking based on bdd characterization , 1999 .
[2] Rolf Drechsler,et al. A genetic algorithm for variable ordering of obdds , 1996 .
[3] Ilan Beer,et al. Efficient Model Checking by Automated Ordering of Transition Relation Partitions , 1994, 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] Rolf Drechsler. Evolutionary algorithms for VLSI CAD , 1998 .
[6] Edmund M. Clarke,et al. Symbolic Model Checking with Partitioned Transistion Relations , 1991, VLSI.
[7] Helmut Veith,et al. Using Combinatorial Optimization Methods for Quantification Scheduling , 2001, CHARME.
[8] Robert K. Brayton,et al. Early quantification and partitioned transition relations , 1996, Proceedings International Conference on Computer Design. VLSI in Computers and Processors.
[9] Helmut Veith,et al. Nonlinear quantification scheduling in image computation , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).
[10] In-Ho Moon,et al. Border-Block Triangular Form and Conjunction Schedule in Image Computation , 2000, FMCAD.