#### DMCA

## Guard-based Partial-Order Reduction

### Citations

3193 | Model Checking. - Clarke, Grumberg, et al. - 1999 |

1623 |
The Temporal Logic of Programs
- Pnueli
- 1977
(Show Context)
Citation Context ...Or by example: to disable the guard pc = 1, is the same as to enable pc = 1. 5 Partial-Order Reduction for On-The-Fly LTL Checking Liveness properties can be expressed in Linear Temporal Logic (LTL) =-=[26]-=-. An example LTL property is □♦p, expressing that from any state in a trace (□ = generally), eventually (♦) a state s can be reached s.t. p(s) holds, where p is a predicate over a state s ∈ ST , simil... |

1493 | The model checker spin
- Holzmann
- 1997
(Show Context)
Citation Context ...tails, it merely needs to export transition guards and their dependencies via Pins. We demonstrate this by extending 2LTSmin’s DVE and Promela [1] front-ends. This allows a direct comparison to Spin =-=[13]-=- (Section 6), which shows that the new algorithm generally provides more reduction using less memory, but takes more time to do so. It also yields more reduction than the theoretically best reduction ... |

690 | An automata-theoretic approach to automatic program verification - Vardi, Wolper - 1986 |

361 | Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem
- Godefroid
- 1996
(Show Context)
Citation Context ...tubborn sets in 1988, 1991 and 1992. Also from 1988 onwards, Peled [16] developed the ample set [23,24], laterextended by Holzmann and Peled [14,25], Godefroid and Pirottin [8,10] the persistent set =-=[9]-=-, and Godefroid and Wolper [11] sleep sets. These foundations have been extended and applied in numerous papers over the past 15 years. Problem and Contributions. Previous work defines partial-order r... |

288 |
A stubborn attack on state explosion
- Valmari
- 1991
(Show Context)
Citation Context ...t during state space generation (on-the-fly), based on the structure of the specification. Already in 1981, Overman [20] suggested a method to avoid exploring all interleavings, followed by Valmari’s =-=[28,31,30]-=- stubborn sets in 1988, 1991 and 1992. Also from 1988 onwards, Peled [16] developed the ample set [23,24], laterextended by Holzmann and Peled [14,25], Godefroid and Pirottin [8,10] the persistent se... |

209 | Combining Partial Order Reductions with On-the-fly Model-Checking
- Peled
- 1995
(Show Context)
Citation Context ...Overman [20] suggested a method to avoid exploring all interleavings, followed by Valmari’s [28,31,30] stubborn sets in 1988, 1991 and 1992. Also from 1988 onwards, Peled [16] developed the ample set =-=[23,24]-=-, laterextended by Holzmann and Peled [14,25], Godefroid and Pirottin [8,10] the persistent set [9], and Godefroid and Wolper [11] sleep sets. These foundations have been extended and applied in nume... |

186 | Stubborn sets for reduced state space generation
- Valmari
- 1989
(Show Context)
Citation Context ...t during state space generation (on-the-fly), based on the structure of the specification. Already in 1981, Overman [20] suggested a method to avoid exploring all interleavings, followed by Valmari’s =-=[28,31,30]-=- stubborn sets in 1988, 1991 and 1992. Also from 1988 onwards, Peled [16] developed the ample set [23,24], laterextended by Holzmann and Peled [14,25], Godefroid and Pirottin [8,10] the persistent se... |

183 | All from one, one for all: on model checking using representatives
- Peled
- 1993
(Show Context)
Citation Context ...Overman [20] suggested a method to avoid exploring all interleavings, followed by Valmari’s [28,31,30] stubborn sets in 1988, 1991 and 1992. Also from 1988 onwards, Peled [16] developed the ample set =-=[23,24]-=-, laterextended by Holzmann and Peled [14,25], Godefroid and Pirottin [8,10] the persistent set [9], and Godefroid and Wolper [11] sleep sets. These foundations have been extended and applied in nume... |

170 | Using partial orders for the efficient verification of deadlock freedom and safety properties - Godefroid, Wolper - 1991 |

155 | Using partial orders to improve automatic verification methods - Godefroid - 1990 |

154 |
The state explosion problem
- Valmari
(Show Context)
Citation Context ...ace. It would therefore be interesting to compare our heuristic algorithm to other approaches like the deletion algorithm [35], selecting a scapegoat [35] and the strongly connected components method =-=[32]-=-, or one of these combined with the heuristics. This would provide more insight in the trade-off between time spent on finding stubborn sets and state space reductions. Challenges remain, as not all o... |

137 |
Memory efficient algorithms for the verification of temporal properties
- Courcoubetis, Vardi, et al.
- 1977
(Show Context)
Citation Context ... . For an exact definition of TMT ⊗B¬ϕ , we refer to [34]. The construction of the cross product can be done on-the-fly, without computing (and storing!) the full state space MT . Therefore, the NDFS =-=[4]-=- algorithm is often used to find accepting cycles (= error traces) as it can do so on-the-fly as well. In the absence of accepting cycles, the original property holds. Table 1. POR provisos for the LT... |

123 | An Improvement in Formal Verification
- Holzmann, Peled
- 1994
(Show Context)
Citation Context ...ring all interleavings, followed by Valmari’s [28,31,30] stubborn sets in 1988, 1991 and 1992. Also from 1988 onwards, Peled [16] developed the ample set [23,24], laterextended by Holzmann and Peled =-=[14,25]-=-, Godefroid and Pirottin [8,10] the persistent set [9], and Godefroid and Wolper [11] sleep sets. These foundations have been extended and applied in numerous papers over the past 15 years. Problem an... |

88 | On nested depth first search - GJ, Peled, et al. - 1996 |

61 | BEEM: Benchmarks for Explicit Model Checkers
- Pelánek
- 2007
(Show Context)
Citation Context ... using less memory, but takes more time to do so. It also yields more reduction than the theoretically best reduction using ample sets, as reported by Geldenhuys et al. [7] on the Dve BEEM benchmarks =-=[22]-=-. Summarising, these are the main contributions presented in this work: 1. Guard-based partial-order reduction, which is a language-independent generalisation of the stubborn set method based on neces... |

34 | A note on on-the-fly verification algorithms - Schwoon, Esparza - 2005 |

32 |
Error detection by reduced reachability graph generation
- Valmari
- 1988
(Show Context)
Citation Context ...t during state space generation (on-the-fly), based on the structure of the specification. Already in 1981, Overman [20] suggested a method to avoid exploring all interleavings, followed by Valmari’s =-=[28,31,30]-=- stubborn sets in 1988, 1991 and 1992. Also from 1988 onwards, Peled [16] developed the ample set [23,24], laterextended by Holzmann and Peled [14,25], Godefroid and Pirottin [8,10] the persistent se... |

29 |
Verification of concurrent systems: Function and timing
- Overman, Crocker
- 1982
(Show Context)
Citation Context ...hms for computing a sufficient successor set. The challenge is to compute this subset during state space generation (on-the-fly), based on the structure of the specification. Already in 1981, Overman =-=[20]-=- suggested a method to avoid exploring all interleavings, followed by Valmari’s [28,31,30] stubborn sets in 1988, 1991 and 1992. Also from 1988 onwards, Peled [16] developed the ample set [23,24], lat... |

21 |
LTSmin: Distributed and Symbolic Reachability
- Blom, Pol, et al.
- 2010
(Show Context)
Citation Context ...ri started early to generalise the stubborn set definition for “transition/variable systems” [29,31]. To address the same problem for model checking algorithms, we earlier proposed the Pins interface =-=[2,19]-=-, separating language front-ends from verification algorithms. Through Pins (Partitioned Interface to the Next-State function), a user can use various high-performance model checking algorithms for hi... |

19 |
Eliminating redundant interleavings during concurrent program verification
- Valmari
- 1989
(Show Context)
Citation Context ...mpute a good syntactic approximation of a sufficient successor set. In recognition of these problems, Valmari started early to generalise the stubborn set definition for “transition/variable systems” =-=[29,31]-=-. To address the same problem for model checking algorithms, we earlier proposed the Pins interface [2,19], separating language front-ends from verification algorithms. Through Pins (Partitioned Inter... |

18 |
An efficient verification method for parallel and distributed programs
- Katz, Peled
- 1989
(Show Context)
Citation Context ...cification. Already in 1981, Overman [20] suggested a method to avoid exploring all interleavings, followed by Valmari’s [28,31,30] stubborn sets in 1988, 1991 and 1992. Also from 1988 onwards, Peled =-=[16]-=- developed the ample set [23,24], laterextended by Holzmann and Peled [14,25], Godefroid and Pirottin [8,10] the persistent set [9], and Godefroid and Wolper [11] sleep sets. These foundations have b... |

15 | On the Stubborn Set Method in Reduced State Space Generation
- Varpaaniemi
- 1998
(Show Context)
Citation Context ...ets. These foundations have been extended and applied in numerous papers over the past 15 years. Problem and Contributions. Previous work defines partial-order reduction in terms of either petri-nets =-=[35]-=- or parallel components with local program counters, called processes [14,9]. While this allows the exploitation of certain formalismspecific properties, like fairness [24] and token conditions [33], ... |

11 |
C.: Solving the ignoring problem for partial order reduction
- Evangelista, Pajault
- 2010
(Show Context)
Citation Context ...ce of livelocks, using an LTL property □♦progress. Table 4 shows the results of POR with C2/C3. In LTSmin, we used three implementations of the visibility matrix (see Section 5) and the color proviso =-=[6]-=- (--proviso=color). To obtain T min vis , we defined progress with a predicate on the program counter (P roc. pc = 1). For T nes vis , we exported an np label through pins and defined ϕ := □♦¬np . Spi... |

8 |
Multi-core LTSmin: Marrying modularity and scalability
- Laarman, Pol, et al.
- 2011
(Show Context)
Citation Context ...ri started early to generalise the stubborn set definition for “transition/variable systems” [29,31]. To address the same problem for model checking algorithms, we earlier proposed the Pins interface =-=[2,19]-=-, separating language front-ends from verification algorithms. Through Pins (Partitioned Interface to the Next-State function), a user can use various high-performance model checking algorithms for hi... |

6 | Parallel Recursive State Compression for Free
- Laarman, Pol, et al.
(Show Context)
Citation Context ...siderably more than ample-based POR in Spin (Though we included memory use for completeness, it only provides an indirect comparison, due to a different state representation and compression in LTSmin =-=[18]-=-). On the other hand, the additional computational overhead of our algorithm is clear from the runtimes. This was expected, as the stubborn-set algorithm considers all transitions whereas the ample-se... |

5 |
de Pol. Improved MultiCore Nested Depth-First Search
- Evangelista, Laarman, et al.
- 2011
(Show Context)
Citation Context ...d efficiently, other methods have to be found. We partly solved this problem for a subset of LTL with the parallel DFSFIFO algorithm [17, end of Sec. 5], but for other parallel algorithms, like CNDFS =-=[5]-=-, this is still future work. One benefit for the parallel algorithms is that the heuristic selection algorithm can find small stubborn sets deterministically, which avoids well-known problems with pos... |

4 |
SpinS: Extending LTSmin with Promela through SpinJa
- Berg, Laarman
- 2012
(Show Context)
Citation Context ...POR without having to bother about its implementation details, it merely needs to export transition guards and their dependencies via Pins. We demonstrate this by extending 2LTSmin’s DVE and Promela =-=[1]-=- front-ends. This allows a direct comparison to Spin [13] (Section 6), which shows that the new algorithm generally provides more reduction using less memory, but takes more time to do so. It also yie... |

4 | A.: Exploring the Scope for Partial Order Reduction
- Geldenhuys, Hansen, et al.
- 2009
(Show Context)
Citation Context ...nerally provides more reduction using less memory, but takes more time to do so. It also yields more reduction than the theoretically best reduction using ample sets, as reported by Geldenhuys et al. =-=[7]-=- on the Dve BEEM benchmarks [22]. Summarising, these are the main contributions presented in this work: 1. Guard-based partial-order reduction, which is a language-independent generalisation of the st... |

4 | Can stubborn sets be optimal
- Valmari, Hansen
- 2010
(Show Context)
Citation Context ...s [35] or parallel components with local program counters, called processes [14,9]. While this allows the exploitation of certain formalismspecific properties, like fairness [24] and token conditions =-=[33]-=-, it also complicates the application to other formalisms, for instance, rule-based systems [12]. Moreover, current implementations are tightly coupled to a particular specification language in order ... |

2 |
der Wulp. The mCRL2 toolset. WASDeTT
- Groote, Keiren, et al.
- 2008
(Show Context)
Citation Context ...llows the exploitation of certain formalismspecific properties, like fairness [24] and token conditions [33], it also complicates the application to other formalisms, for instance, rule-based systems =-=[12]-=-. Moreover, current implementations are tightly coupled to a particular specification language in order to compute a good syntactic approximation of a sufficient successor set. In recognition of these... |

2 | Improved On-The-Fly Livelock Detection - Laarman, Fárago - 2013 |

1 | Partial Order Reduction for
- Pater
- 2011
(Show Context)
Citation Context ...ary enabling set on-the-fly, we statically assign each guard a necessary enabling set by default. Only transitions that write to state vector variables used by this guard need to be considered (as in =-=[21]-=-): N min g := {t ∈ T | Ts(g) ∩ Ws(t) = ∅} 74.2 Necessary Disabling Sets Consider the computation of a stubborn set Ts in state s along the lines of Algorithm 1. If a disabled t gets in the stubborn ... |