Sciweavers

296 search results - page 2 / 60
» Solving the ignoring problem for partial order reduction
Sort
View
ACSD
2010
IEEE
261views Hardware» more  ACSD 2010»
13 years 3 months ago
Partial Order Reduction for Branching Security Protocols
We extend the partial order reduction algorithm of Clarke et al. [CJM00] to handle branching security protocols, such as optimistic fair exchange protocols. Applications of the pro...
Wan Fokkink, Mohammad Torabi Dashti, Anton Wijs
ASE
2004
167views more  ASE 2004»
13 years 5 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
IPL
2008
131views more  IPL 2008»
13 years 5 months ago
Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models
In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in co...
J. Francisco Chicano, Enrique Alba
FSTTCS
1998
Springer
13 years 9 months ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim
ENTCS
2006
134views more  ENTCS 2006»
13 years 5 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...