Optimized Assignment Coverage Computation in Formal Verification of Digital Systems

Model checking thoroughly verifies the design correctness with respect to a specification. When the verification process succeeds, we can only postulate the correctness of the design relative to the given specification. How far can we affirm the verified design implements all the behavior of the desired system? With this regard we need to estimate the completeness of the properties by using some coverage metrics. In this paper, we have proposed a new metric called assignment coverage and an optimized method to overcome the intensive computations required for the multiple transformations among the abstract layers in the verification tool. The proposed coverage computation method provides adequate information to complete the set of properties. Finally, we have applied the proposed metric to some verification benchmark to reveal the effectiveness of this metric in finding undetected coverage holes.

[1]  Jae-Young Jang,et al.  Iterative abstraction-based CTL model checking , 2000, DATE '00.

[2]  Orna Grumberg,et al.  "Have I written enough Properties?" - A Method of Comparison between Specification and Implementation , 1999, CHARME.

[3]  Stephan Merz,et al.  Model Checking , 2000 .

[4]  Robert P. Kurshan,et al.  A Practical Approach to Coverage in Model Checking , 2001, CAV.

[5]  Mohammad Reza Kakoee,et al.  Using integer equations for high level formal verification property checking , 2003, Fourth International Symposium on Quality Electronic Design, 2003. Proceedings..

[6]  F. Somenzi,et al.  Do's and don'ts of CTL state coverage estimation , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[7]  Z. Navabi,et al.  Handling complex VHDL semantics with an OO intermediate format , 2001, Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555).

[8]  Tiziano Villa,et al.  VIS: A System for Verification and Synthesis , 1996, CAV.

[9]  Timothy Kam,et al.  Coverage estimation for symbolic model checking , 1999, DAC '99.

[10]  Hamid Shojaei,et al.  Signal Coverage Computation in Formal Verification , 2006, 2006 IFIP International Conference on Very Large Scale Integration.

[11]  Fabio Somenzi,et al.  Vacuum Cleaning CTL Formulae , 2002, CAV.

[12]  H. Andersen.  An Introduction to Binary Decision Diagrams , 1997 .

[13]  Shinji Kimura,et al.  Transition-based coverage estimation for symbolic model checking , 2006, Asia and South Pacific Conference on Design Automation, 2006..