Combining partial order reductions with on-the-fly model-checking

Doron Peled

doi:10.1007/3-540-58179-0_69

Combining partial order reductions with on-the-fly model-checking

Doron Peled

Lucent

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

160 Scopus citations

Abstract

Partial order model-checking is an approach to reduce time and memory in model-checking concurrent programs. On-the-fly model-checking is a technique to eliminate part of the search by intersecting the (negation of the) checked property with the state space during its generation. We prove conditions under which these two methods can be combined in order to gain from both reductions. An extension of the model-checker SPIN, which implements this combination, is studied, showing substantial reduction over traditional search, not only in the number of reachable states, but directly in the amount of memory and time used.

Original language	English
Title of host publication	Computer Aided Verification - 6th International Conference, CAV 1994, Proceedings
Editors	David L. Dill
Publisher	Springer Verlag
Pages	377-390
Number of pages	14
ISBN (Print)	9783540581796
DOIs	https://doi.org/10.1007/3-540-58179-0_69
State	Published - 1994
Externally published	Yes
Event	6th International Conference on Computer Aided Verification, CAV 1994 - Stanford, United States Duration: 21 Jun 1994 → 23 Jun 1994

Publication series

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

Conference

Conference	6th International Conference on Computer Aided Verification, CAV 1994
Country/Territory	United States
City	Stanford
Period	21/06/94 → 23/06/94

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1994.

Access to Document

10.1007/3-540-58179-0_69

Cite this

Peled, D. (1994). Combining partial order reductions with on-the-fly model-checking. In D. L. Dill (Ed.), Computer Aided Verification - 6th International Conference, CAV 1994, Proceedings (pp. 377-390). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 818 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-58179-0_69

@inproceedings{8b6a3dc534c14d928586982a1542a808,

title = "Combining partial order reductions with on-the-fly model-checking",

abstract = "Partial order model-checking is an approach to reduce time and memory in model-checking concurrent programs. On-the-fly model-checking is a technique to eliminate part of the search by intersecting the (negation of the) checked property with the state space during its generation. We prove conditions under which these two methods can be combined in order to gain from both reductions. An extension of the model-checker SPIN, which implements this combination, is studied, showing substantial reduction over traditional search, not only in the number of reachable states, but directly in the amount of memory and time used.",

author = "Doron Peled",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1994.; 6th International Conference on Computer Aided Verification, CAV 1994 ; Conference date: 21-06-1994 Through 23-06-1994",

year = "1994",

doi = "10.1007/3-540-58179-0_69",

language = "אנגלית",

isbn = "9783540581796",

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

publisher = "Springer Verlag",

pages = "377--390",

editor = "Dill, {David L.}",

booktitle = "Computer Aided Verification - 6th International Conference, CAV 1994, Proceedings",

address = "גרמניה",

}

Peled, D 1994, Combining partial order reductions with on-the-fly model-checking. in DL Dill (ed.), Computer Aided Verification - 6th International Conference, CAV 1994, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 818 LNCS, Springer Verlag, pp. 377-390, 6th International Conference on Computer Aided Verification, CAV 1994, Stanford, United States, 21/06/94. https://doi.org/10.1007/3-540-58179-0_69

Combining partial order reductions with on-the-fly model-checking. / Peled, Doron.
Computer Aided Verification - 6th International Conference, CAV 1994, Proceedings. ed. / David L. Dill. Springer Verlag, 1994. p. 377-390 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 818 LNCS).

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

TY - GEN

T1 - Combining partial order reductions with on-the-fly model-checking

AU - Peled, Doron

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

PY - 1994

Y1 - 1994

N2 - Partial order model-checking is an approach to reduce time and memory in model-checking concurrent programs. On-the-fly model-checking is a technique to eliminate part of the search by intersecting the (negation of the) checked property with the state space during its generation. We prove conditions under which these two methods can be combined in order to gain from both reductions. An extension of the model-checker SPIN, which implements this combination, is studied, showing substantial reduction over traditional search, not only in the number of reachable states, but directly in the amount of memory and time used.

AB - Partial order model-checking is an approach to reduce time and memory in model-checking concurrent programs. On-the-fly model-checking is a technique to eliminate part of the search by intersecting the (negation of the) checked property with the state space during its generation. We prove conditions under which these two methods can be combined in order to gain from both reductions. An extension of the model-checker SPIN, which implements this combination, is studied, showing substantial reduction over traditional search, not only in the number of reachable states, but directly in the amount of memory and time used.

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

U2 - 10.1007/3-540-58179-0_69

DO - 10.1007/3-540-58179-0_69

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

AN - SCOPUS:70350750512

SN - 9783540581796

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

SP - 377

EP - 390

BT - Computer Aided Verification - 6th International Conference, CAV 1994, Proceedings

A2 - Dill, David L.

PB - Springer Verlag

T2 - 6th International Conference on Computer Aided Verification, CAV 1994

Y2 - 21 June 1994 through 23 June 1994

ER -

Peled D. Combining partial order reductions with on-the-fly model-checking. In Dill DL, editor, Computer Aided Verification - 6th International Conference, CAV 1994, Proceedings. Springer Verlag. 1994. p. 377-390. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-58179-0_69

Combining partial order reductions with on-the-fly model-checking

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this