论文信息 - Dos and don'ts of CTL state coverage estimation

Dos and don'ts of CTL state coverage estimation

Coverage estimation for model checking quantifies the completeness of a set of properties. We present an improved version of the algorithm of Hoskote et al. [7] that applies to a larger subset of CTL; we prove properties of the algorithm and apply it to three case studies. From these case studies we derive recommendations for an effective use of coverage estimation.

Fabio Somenzi | Mitra Purandare | Nikhil Jayakumar

[1] Fabio Somenzi,et al. A Symbolic Algorithms for Maximum Flow in 0-1 Networks , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[2] Orna Kupferman,et al. Coverage Metrics for Temporal Logic Model Checking , 2001, TACAS.

[3] Fabio Somenzi,et al. A Symbolic Algorithms for Maximum Flow in 0-1 Networks , 1997, Formal Methods Syst. Des..

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

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

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

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

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

[9] C. Eisner,et al. Efficient Detection of Vacuity in ACTL Formulaas , 1997, CAV.

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

[11] Cedric Paul Nr. Melksham Hackwell,et al. A vacuum cleaning , 2003 .