Cartesian partial-order reduction

Guy Gueta; Cormac Flanagan; Eran Yahav; Mooly Sagiv

doi:10.1007/978-3-540-73370-6_8

Cartesian partial-order reduction

Guy Gueta, Cormac Flanagan, Eran Yahav, Mooly Sagiv

School of Computer Sciences

Research output: Contribution to journal › Conference article › peer-review

Abstract

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 language	English
Pages (from-to)	95-112
Number of pages	18
Journal	Lecture Notes in Computer Science
Volume	4595 LNCS
DOIs	https://doi.org/10.1007/978-3-540-73370-6_8
State	Published - 2007
Event	14th International SPIN Workshop: Model Checking Software, 2007 - Berlin, Germany Duration: 1 Jul 2007 → 3 Jul 2007

Access to Document

10.1007/978-3-540-73370-6_8

Cite this

@article{cf0083dc37a64fd99b90b4c4cc743b90,

title = "Cartesian partial-order reduction",

abstract = "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.",

author = "Guy Gueta and Cormac Flanagan and Eran Yahav and Mooly Sagiv",

year = "2007",

doi = "10.1007/978-3-540-73370-6_8",

language = "אנגלית",

volume = "4595 LNCS",

pages = "95--112",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

note = "null ; Conference date: 01-07-2007 Through 03-07-2007",

}

TY - JOUR

T1 - Cartesian partial-order reduction

AU - Gueta, Guy

AU - Flanagan, Cormac

AU - Yahav, Eran

AU - Sagiv, Mooly

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38149056385&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-73370-6_8

DO - 10.1007/978-3-540-73370-6_8

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:38149056385

VL - 4595 LNCS

SP - 95

EP - 112

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

Y2 - 1 July 2007 through 3 July 2007

ER -

Cartesian partial-order reduction

Abstract

Access to Document

Other files and links

Fingerprint

Cite this