A genetic approach for conjunction scheduling in symbolic equivalence checking

A key issue in symbolic equivalence checking algorithms is image computation. Conjunction scheduling is a strategy to keep the size of BDDs small for the intermediate results of image computation. Conjunction scheduling consists of ordering bit transition relations, clustering subsets of them and ordering the clusters. We present a genetic algorithm (GA) approach for conjunction scheduling based on the dependency matrix of transition relations. Our GA approach offers improvement over existing algorithms by minimizing the active lifetime of variables at the same time. Our experimental results show the effectiveness of the algorithm.

[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.