Ten years of partial order reduction

Doron Peled

doi:10.1007/bfb0028727

Ten years of partial order reduction

Doron Peled

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

103 Scopus citations

Abstract

Checking the properties of concurrent systems is an ever growing challenge. Along with the development of improved verification methods, some critical systems that require careful attention have become highly concurrent and intricate. Partial order reduction methods were proposed for reducing the time and memory required to automatically verify concurrent asynchronous systems. We describe partial order reduction for various logical formalisms, such as LTL, CTL and process algebras. We show how one can combine partial order reduction with other efficient model checking techniques.

Original language	English
Title of host publication	Computer Aided Verification - 10th International Conference, CAV'98, Proceedings
Publisher	Springer Verlag
Pages	17-28
Number of pages	12
ISBN (Print)	3540646086, 9783540646082
DOIs	https://doi.org/10.1007/bfb0028727
State	Published - 1998
Externally published	Yes
Event	10th International Conference on Computer-Aided Verification, CAV'98 - Vancouver, BC, Canada Duration: 28 Jun 1998 → 2 Jul 1998

Publication series

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

Conference

Conference	10th International Conference on Computer-Aided Verification, CAV'98
Country/Territory	Canada
City	Vancouver, BC
Period	28/06/98 → 2/07/98

Access to Document

10.1007/bfb0028727

Cite this

@inproceedings{a884d481e6c04e8d94f058d4d0f049ca,

title = "Ten years of partial order reduction",

abstract = "Checking the properties of concurrent systems is an ever growing challenge. Along with the development of improved verification methods, some critical systems that require careful attention have become highly concurrent and intricate. Partial order reduction methods were proposed for reducing the time and memory required to automatically verify concurrent asynchronous systems. We describe partial order reduction for various logical formalisms, such as LTL, CTL and process algebras. We show how one can combine partial order reduction with other efficient model checking techniques.",

author = "Doron Peled",

year = "1998",

doi = "10.1007/bfb0028727",

language = "אנגלית",

isbn = "3540646086",

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

publisher = "Springer Verlag",

pages = "17--28",

booktitle = "Computer Aided Verification - 10th International Conference, CAV'98, Proceedings",

address = "גרמניה",

note = "10th International Conference on Computer-Aided Verification, CAV'98 ; Conference date: 28-06-1998 Through 02-07-1998",

}

Peled, D 1998, Ten years of partial order reduction. in Computer Aided Verification - 10th International Conference, CAV'98, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1427 LNCS, Springer Verlag, pp. 17-28, 10th International Conference on Computer-Aided Verification, CAV'98, Vancouver, BC, Canada, 28/06/98. https://doi.org/10.1007/bfb0028727

Ten years of partial order reduction. / Peled, Doron.
Computer Aided Verification - 10th International Conference, CAV'98, Proceedings. Springer Verlag, 1998. p. 17-28 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1427 LNCS).

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

TY - GEN

T1 - Ten years of partial order reduction

AU - Peled, Doron

PY - 1998

Y1 - 1998

N2 - Checking the properties of concurrent systems is an ever growing challenge. Along with the development of improved verification methods, some critical systems that require careful attention have become highly concurrent and intricate. Partial order reduction methods were proposed for reducing the time and memory required to automatically verify concurrent asynchronous systems. We describe partial order reduction for various logical formalisms, such as LTL, CTL and process algebras. We show how one can combine partial order reduction with other efficient model checking techniques.

AB - Checking the properties of concurrent systems is an ever growing challenge. Along with the development of improved verification methods, some critical systems that require careful attention have become highly concurrent and intricate. Partial order reduction methods were proposed for reducing the time and memory required to automatically verify concurrent asynchronous systems. We describe partial order reduction for various logical formalisms, such as LTL, CTL and process algebras. We show how one can combine partial order reduction with other efficient model checking techniques.

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

U2 - 10.1007/bfb0028727

DO - 10.1007/bfb0028727

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

AN - SCOPUS:84863913545

SN - 3540646086

SN - 9783540646082

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

SP - 17

EP - 28

BT - Computer Aided Verification - 10th International Conference, CAV'98, Proceedings

PB - Springer Verlag

T2 - 10th International Conference on Computer-Aided Verification, CAV'98

Y2 - 28 June 1998 through 2 July 1998

ER -

Ten years of partial order reduction

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this