Sciweavers

6 search results - page 1 / 2
» Improving Spin's Partial-Order Reduction for Breadth-First S...
Sort
View
SPIN
2005
Springer
13 years 10 months ago
Improving Spin's Partial-Order Reduction for Breadth-First Search
We describe an improvement of the partial-order reduction algorithm for breadth-first search which was introduced in Spin version 4.0. Our improvement is based on the algorithm by...
Dragan Bosnacki, Gerard J. Holzmann
SPIN
2009
Springer
13 years 11 months ago
Improving Non-Progress Cycle Checks
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
David Faragó, Peter H. Schmitt
STTT
2010
120views more  STTT 2010»
12 years 11 months ago
Solving the ignoring problem for partial order reduction
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Sami Evangelista, Christophe Pajault
ASE
2004
167views more  ASE 2004»
13 years 4 months ago
Cluster-Based Partial-Order Reduction
The verification of concurrent systems through an exhaustive traversal of the state space suffers from the infamous state-space-explosion problem, caused by the many interleavings ...
Twan Basten, Dragan Bosnacki, Marc Geilen
PSTV
1992
113views Hardware» more  PSTV 1992»
13 years 5 months ago
Coverage Preserving Reduction Strategies for Reachability Analysis
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are imp...
Gerard J. Holzmann, Patrice Godefroid, Didier Piro...