Cartesian Partial-Order Reduction

  title={Cartesian Partial-Order Reduction},
  author={Guy Golan-Gueta and Cormac Flanagan and Eran Yahav and Shmuel Sagiv},
Verifying concurrent programs is challenging since the num ber of thread interleavings that need to be explored can be huge eve n for moderate programs. We present a cartesian semanticsthat reduces the amount of nondeterminism in concurrent programs by delaying unnecessar y context switches. Using this semantics, we construct a novel dynamic partialorder reduction algorithm. We have implemented our algorithm and evaluate it o n a small set of benchmarks. Our preliminary experimental results… CONTINUE READING
Highly Cited
This paper has 49 citations. REVIEW CITATIONS