Partial order reduction: Model-checking using representatives

Doron Peled

doi:10.1007/3-540-61550-4_141

Partial order reduction: Model-checking using representatives

Doron Peled

Lucent

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

22 Scopus citations

Abstract

Partial order reductions is a family of techniques for diminishing the state-space explosion problem for model-checking concurrent programs. It is based on the observation that execution sequences of a concurrent program can be grouped together into equivalence classes that are indistinguishable by the property to be checked. Applying the reduction constructs a reduced state-space that generates at least one representative for each equivalence class. This paper surveys some algorithms for partial order model-checking. The presentation focuses on the verification using representatives approach. The reduction approach is extended to branching specitications.

Original language	English
Title of host publication	Mathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings
Editors	Wojciech Penczek, Andrzej Szalas
Publisher	Springer Verlag
Pages	93-112
Number of pages	20
ISBN (Print)	3540615504, 9783540615507
DOIs	https://doi.org/10.1007/3-540-61550-4_141
State	Published - 1996
Externally published	Yes
Event	21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996 - Cracow, Poland Duration: 2 Sep 1996 → 6 Sep 1996

Publication series

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

Conference

Conference	21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996
Country/Territory	Poland
City	Cracow
Period	2/09/96 → 6/09/96

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1996.

Access to Document

10.1007/3-540-61550-4_141

Cite this

Peled, D. (1996). Partial order reduction: Model-checking using representatives. In W. Penczek, & A. Szalas (Eds.), Mathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings (pp. 93-112). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1113). Springer Verlag. https://doi.org/10.1007/3-540-61550-4_141

Peled, Doron. / Partial order reduction : Model-checking using representatives. Mathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings. editor / Wojciech Penczek ; Andrzej Szalas. Springer Verlag, 1996. pp. 93-112 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{cc5fdebf7324457a871711530d2fe670,

title = "Partial order reduction: Model-checking using representatives",

abstract = "Partial order reductions is a family of techniques for diminishing the state-space explosion problem for model-checking concurrent programs. It is based on the observation that execution sequences of a concurrent program can be grouped together into equivalence classes that are indistinguishable by the property to be checked. Applying the reduction constructs a reduced state-space that generates at least one representative for each equivalence class. This paper surveys some algorithms for partial order model-checking. The presentation focuses on the verification using representatives approach. The reduction approach is extended to branching specitications.",

author = "Doron Peled",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1996.; 21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996 ; Conference date: 02-09-1996 Through 06-09-1996",

year = "1996",

doi = "10.1007/3-540-61550-4\_141",

language = "אנגלית",

isbn = "3540615504",

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

publisher = "Springer Verlag",

pages = "93--112",

editor = "Wojciech Penczek and Andrzej Szalas",

booktitle = "Mathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings",

address = "גרמניה",

}

Peled, D 1996, Partial order reduction: Model-checking using representatives. in W Penczek & A Szalas (eds), Mathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1113, Springer Verlag, pp. 93-112, 21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996, Cracow, Poland, 2/09/96. https://doi.org/10.1007/3-540-61550-4_141

Partial order reduction: Model-checking using representatives. / Peled, Doron.
Mathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings. ed. / Wojciech Penczek; Andrzej Szalas. Springer Verlag, 1996. p. 93-112 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1113).

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

TY - GEN

T1 - Partial order reduction

T2 - 21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996

AU - Peled, Doron

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

PY - 1996

Y1 - 1996

N2 - Partial order reductions is a family of techniques for diminishing the state-space explosion problem for model-checking concurrent programs. It is based on the observation that execution sequences of a concurrent program can be grouped together into equivalence classes that are indistinguishable by the property to be checked. Applying the reduction constructs a reduced state-space that generates at least one representative for each equivalence class. This paper surveys some algorithms for partial order model-checking. The presentation focuses on the verification using representatives approach. The reduction approach is extended to branching specitications.

AB - Partial order reductions is a family of techniques for diminishing the state-space explosion problem for model-checking concurrent programs. It is based on the observation that execution sequences of a concurrent program can be grouped together into equivalence classes that are indistinguishable by the property to be checked. Applying the reduction constructs a reduced state-space that generates at least one representative for each equivalence class. This paper surveys some algorithms for partial order model-checking. The presentation focuses on the verification using representatives approach. The reduction approach is extended to branching specitications.

UR - https://www.scopus.com/pages/publications/84947900891

U2 - 10.1007/3-540-61550-4_141

DO - 10.1007/3-540-61550-4_141

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

AN - SCOPUS:84947900891

SN - 3540615504

SN - 9783540615507

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

SP - 93

EP - 112

BT - Mathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings

A2 - Penczek, Wojciech

A2 - Szalas, Andrzej

PB - Springer Verlag

Y2 - 2 September 1996 through 6 September 1996

ER -

Peled D. Partial order reduction: Model-checking using representatives. In Penczek W, Szalas A, editors, Mathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings. Springer Verlag. 1996. p. 93-112. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-61550-4_141

Partial order reduction: Model-checking using representatives

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this