A practical approach to coverage in model checking

Hana Chockler; Orna Kupferman; Robert P. Kurshan; Moshe Y. Vardi

doi:10.1007/3-540-44585-4_7

A practical approach to coverage in model checking

Hana Chockler, Orna Kupferman, Robert P. Kurshan, Moshe Y. Vardi

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

76 Scopus citations

Abstract

In formal verification, we verify that a system is correct with respect to a specification. When verification succeeds and the system is proven to be correct, there is still a question of how complete the specification is, and whether it really covers all the behaviors of the system. In this paper we study coverage metrics for model checking from a practical point of view. Coverage metrics are based on modifications we apply to the system in order to check which parts of it were actually relevant for the verification process to succeed. We suggest several definitions of coverage, suitable for specifications given in linear temporal logic or by automata on infinite words. We describe two algorithms for computing the parts of the system that are not covered by the specification. The first algorithm is built on top of automata-based model-checking algorithms. The second algorithm reduces the coverage problem to the model-checking problem. Both algorithms can be implemented on top of existing model checking tools.

Original language	English
Title of host publication	Computer Aided Verification - 13th International Conference, CAV 2001, Proceedings
Editors	Hubert Comon, Alain Finkel, Gérard Berry
Publisher	Springer Verlag
Pages	66-78
Number of pages	13
ISBN (Print)	3540423451
DOIs	https://doi.org/10.1007/3-540-44585-4_7
State	Published - 2001
Event	13th International Conference on Computer Aided Verification, CAV 2001 - Paris, France Duration: 18 Jul 2001 → 22 Jul 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2102
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th International Conference on Computer Aided Verification, CAV 2001
Country/Territory	France
City	Paris
Period	18/07/01 → 22/07/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Access to Document

10.1007/3-540-44585-4_7

Cite this

Chockler, H., Kupferman, O., Kurshan, R. P., & Vardi, M. Y. (2001). A practical approach to coverage in model checking. In H. Comon, A. Finkel, & G. Berry (Eds.), Computer Aided Verification - 13th International Conference, CAV 2001, Proceedings (pp. 66-78). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2102). Springer Verlag. https://doi.org/10.1007/3-540-44585-4_7

Chockler, Hana ; Kupferman, Orna ; Kurshan, Robert P. et al. / A practical approach to coverage in model checking. Computer Aided Verification - 13th International Conference, CAV 2001, Proceedings. editor / Hubert Comon ; Alain Finkel ; Gérard Berry. Springer Verlag, 2001. pp. 66-78 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9e96a5ae438746e7a6bbfc5ca73b6ed2,

title = "A practical approach to coverage in model checking",

abstract = "In formal verification, we verify that a system is correct with respect to a specification. When verification succeeds and the system is proven to be correct, there is still a question of how complete the specification is, and whether it really covers all the behaviors of the system. In this paper we study coverage metrics for model checking from a practical point of view. Coverage metrics are based on modifications we apply to the system in order to check which parts of it were actually relevant for the verification process to succeed. We suggest several definitions of coverage, suitable for specifications given in linear temporal logic or by automata on infinite words. We describe two algorithms for computing the parts of the system that are not covered by the specification. The first algorithm is built on top of automata-based model-checking algorithms. The second algorithm reduces the coverage problem to the model-checking problem. Both algorithms can be implemented on top of existing model checking tools.",

author = "Hana Chockler and Orna Kupferman and Kurshan, {Robert P.} and Vardi, {Moshe Y.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 13th International Conference on Computer Aided Verification, CAV 2001 ; Conference date: 18-07-2001 Through 22-07-2001",

year = "2001",

doi = "10.1007/3-540-44585-4_7",

language = "אנגלית",

isbn = "3540423451",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "66--78",

editor = "Hubert Comon and Alain Finkel and G{\'e}rard Berry",

booktitle = "Computer Aided Verification - 13th International Conference, CAV 2001, Proceedings",

address = "גרמניה",

}

Chockler, H, Kupferman, O, Kurshan, RP & Vardi, MY 2001, A practical approach to coverage in model checking. in H Comon, A Finkel & G Berry (eds), Computer Aided Verification - 13th International Conference, CAV 2001, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2102, Springer Verlag, pp. 66-78, 13th International Conference on Computer Aided Verification, CAV 2001, Paris, France, 18/07/01. https://doi.org/10.1007/3-540-44585-4_7

A practical approach to coverage in model checking. / Chockler, Hana; Kupferman, Orna; Kurshan, Robert P. et al.
Computer Aided Verification - 13th International Conference, CAV 2001, Proceedings. ed. / Hubert Comon; Alain Finkel; Gérard Berry. Springer Verlag, 2001. p. 66-78 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2102).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A practical approach to coverage in model checking

AU - Chockler, Hana

AU - Kupferman, Orna

AU - Kurshan, Robert P.

AU - Vardi, Moshe Y.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

N2 - In formal verification, we verify that a system is correct with respect to a specification. When verification succeeds and the system is proven to be correct, there is still a question of how complete the specification is, and whether it really covers all the behaviors of the system. In this paper we study coverage metrics for model checking from a practical point of view. Coverage metrics are based on modifications we apply to the system in order to check which parts of it were actually relevant for the verification process to succeed. We suggest several definitions of coverage, suitable for specifications given in linear temporal logic or by automata on infinite words. We describe two algorithms for computing the parts of the system that are not covered by the specification. The first algorithm is built on top of automata-based model-checking algorithms. The second algorithm reduces the coverage problem to the model-checking problem. Both algorithms can be implemented on top of existing model checking tools.

AB - In formal verification, we verify that a system is correct with respect to a specification. When verification succeeds and the system is proven to be correct, there is still a question of how complete the specification is, and whether it really covers all the behaviors of the system. In this paper we study coverage metrics for model checking from a practical point of view. Coverage metrics are based on modifications we apply to the system in order to check which parts of it were actually relevant for the verification process to succeed. We suggest several definitions of coverage, suitable for specifications given in linear temporal logic or by automata on infinite words. We describe two algorithms for computing the parts of the system that are not covered by the specification. The first algorithm is built on top of automata-based model-checking algorithms. The second algorithm reduces the coverage problem to the model-checking problem. Both algorithms can be implemented on top of existing model checking tools.

UR - http://www.scopus.com/inward/record.url?scp=84958778315&partnerID=8YFLogxK

U2 - 10.1007/3-540-44585-4_7

DO - 10.1007/3-540-44585-4_7

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84958778315

SN - 3540423451

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 66

EP - 78

BT - Computer Aided Verification - 13th International Conference, CAV 2001, Proceedings

A2 - Comon, Hubert

A2 - Finkel, Alain

A2 - Berry, Gérard

PB - Springer Verlag

T2 - 13th International Conference on Computer Aided Verification, CAV 2001

Y2 - 18 July 2001 through 22 July 2001

ER -

Chockler H, Kupferman O, Kurshan RP, Vardi MY. A practical approach to coverage in model checking. In Comon H, Finkel A, Berry G, editors, Computer Aided Verification - 13th International Conference, CAV 2001, Proceedings. Springer Verlag. 2001. p. 66-78. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44585-4_7

A practical approach to coverage in model checking

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this