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 - http://www.scopus.com/inward/record.url?scp=84863913545&partnerID=8YFLogxK
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 -