Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

SPIN
2007
Springer

favoriteEmaildiscussreport

129views Theoretical Computer Science» more SPIN 2007»

Cartesian Partial-Order Reduction

13 years 10 months ago

Cartesian Partial-Order Reduction

Download www.cs.tau.ac.il

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 signiﬁcant potential saving in the number of explored states and transitions.

Guy Gueta, Cormac Flanagan, Eran Yahav, Mooly Sagi

Real-time Traffic

Concurrent Programs | Partial-order Reduction Algorithm | SPIN 2007 | Theoretical Computer Science | Unnecessary Context Switches |

claim paper

Related Content

» Monotonic Partial Order Reduction An Optimal Symbolic Partial Order Reduction Technique

» Checking Secrecy by Means of Partial Order Reduction

» Partial Order Reduction for Probabilistic Branching Time

» Symbolic Partial Order Reduction for Rule Based Transition Systems

» Distributed dynamic partial order reduction

» Partial Order Reduction for Verification of RealTime Components

» Partial Order Reduction for Probabilistic Systems A Revision for Distributed Schedulers

» Partial Order Reduction for Rewriting Semantics of Programming Languages

» Partial Order Reduction for Branching Security Protocols

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	SPIN
Authors	Guy Gueta, Cormac Flanagan, Eran Yahav, Mooly Sagiv

Comments (0)