Partial order reduction

Known as: Reduction 
In computer science, partial order reduction is a technique for reducing the size of the state-space to be searched by a model checking algorithm. It… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Partial order reduction (POR) and net unfoldings are two alternative methods to tackle statespace explosion caused by concurrency… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Stateless model checking is a powerful technique for program verification, which however suffers from an exponential growth in… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 3
Is this relevant?
2013
2013
Eliminating concurrency errors is increasingly important as systems rely more on parallelism for performance. Exhaustively… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Systematic testing, first demonstrated in small, specialized cases 15 years ago, has matured sufficiently for large-scale systems… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order… (More)
  • figure 1
  • figure 4
  • figure 5
  • table 1
Is this relevant?
2007
2007
Verifying concurrent programs is challenging since the num ber of thread interleavings that need to be explored can be huge eve n… (More)
  • figure 4
  • figure 5
  • figure 10
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 8
Is this relevant?
2004
2004
The verification of concurrent systems through an exhaustive traversal of the state space suffers from the infamous state-space… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1998
1 I n t r o d u c t i o n One c o m m o n me thod for dealing with the intrinsically intractable computa t iona l complexi ty of… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
In this paper, we present a partial-order reduction method for timed systems based on a local-time semantics for networks of… (More)
  • figure 1
  • figure 2
Is this relevant?