An optimization approach for SoC FSM verification

Verification is a bottleneck in IC design, and how to do FSM verification is the main part of the problem. A new approach based on digraph theory and mathematical programming, whose target is to verify all the state transitions in the optimized time, is presented in This work. The FSM verification path can be generated automatically by this approach and this method has been applied in the C*SOC verification environment, and the experimental result shows the method can accelerate the verification process efficiently.

[1]  Pavlos Konas,et al.  Verification of configurable processor cores , 2000, Proceedings 37th Design Automation Conference.

[2]  Chris J. Myers,et al.  Level oriented formal model for asynchronous circuit verification and its efficient analysis method , 2002, 2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings..

[3]  Janick Bergeron,et al.  Writing Testbenches: Functional Verification of HDL Models , 2000 .

[4]  Tom Chen,et al.  Improving the efficiency and quality of simulation-based behavioral model verification using dynamic Bayesian criteria , 2002, Proceedings International Symposium on Quality Electronic Design.

[5]  Carl Pixley,et al.  Automatic derivation of FSM specification to implementation encoding , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[6]  Faisal Imdad-Haque,et al.  The art of verification with Vera , 2001 .

[7]  Stylianos Perissakis,et al.  Verification of a complex SoC; the PRO/sup 3/ case-study , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.