Multi-clock path analysis using propositional satisfiability

We present a satisfiability based multi-clock path analysis method. The method uses propositional satisfiability (SAT) in the detection of multi-clock paths. We show a method to reduce the multi-clock path detection problems to SAT problems. We also show heuristics on the conversion from multi-level circuits into CNF formulae. We have applied our method to ISCAS89 benchmarks and other sample circuits. Experimental results show the improvement on the manipulatable size of circuits by using SAT.

[1]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[2]  Kazuyoshi Takagi,et al.  Timing Verification of Sequential Logic Circuits Based on Controlled Multi-Clock Path Analysis (Special Section on VLSI Design and CAD Algorithms) , 1998 .

[3]  Tracy Larrabee,et al.  Test pattern generation using Boolean satisfiability , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.

[5]  DavisMartin,et al.  A Computing Procedure for Quantification Theory , 1960 .

[6]  Masahiro Fujita,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, DAC '99.

[7]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[8]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[9]  Joseph Sifakis,et al.  Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

[10]  Hantao Zhang,et al.  SATO: An Efficient Propositional Prover , 1997, CADE.

[11]  Daniel P. Siewiorek,et al.  Automated Multi-Cycle Symbolic Timing Verification of Microprocessor-based Designs , 1994, 31st Design Automation Conference.

[12]  Kazuyoshi Takagi,et al.  Waiting false path analysis of sequential logic circuits for performance optimization , 1998, ICCAD.

[13]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[14]  S. Yang,et al.  Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .

[15]  Editors , 1986, Brain Research Bulletin.

[16]  Robert K. Brayton,et al.  Delay Models and Exact Timing Analysis , 1993 .

[17]  Luis Miguel Silveira,et al.  Timing analysis using propositional satisfiability , 1998, 1998 IEEE International Conference on Electronics, Circuits and Systems. Surfing the Waves of Science and Technology (Cat. No.98EX196).