Cartesian partial-order reduction

Guy Gueta*, Cormac Flanagan, Eran Yahav, Mooly Sagiv

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

44 Scopus citations


Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semantics that reduces the amount of nondeterminism in concurrent programs by delaying unnecessary context switches. Using this semantics, we construct a novel dynamic partial-order reduction algorithm. We have implemented our algorithm and evaluate it on a small set of benchmarks. Our preliminary experimental results show a significant potential saving in the number of explored states and transitions.

Original languageEnglish
Pages (from-to)95-112
Number of pages18
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4595 LNCS
StatePublished - 2007
Event14th International SPIN Workshop: Model Checking Software, 2007 - Berlin, Germany
Duration: 1 Jul 20073 Jul 2007


Dive into the research topics of 'Cartesian partial-order reduction'. Together they form a unique fingerprint.

Cite this