Sciweavers

35 search results - page 1 / 7
» Partial Order Reduction for Branching Security Protocols
Sort
View
ACSD
2010
IEEE
261views Hardware» more  ACSD 2010»
13 years 2 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
SAM
2004
151views Hardware» more  SAM 2004»
13 years 6 months ago
Checking Secrecy by Means of Partial Order Reduction
We propose a partial order reduction for model checking security protocols for the secrecy property. Based on this reduction we develop an automatic tool that can check security pr...
Cas J. F. Cremers, Sjouke Mauw
ENTCS
2006
134views more  ENTCS 2006»
13 years 4 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ö...
COMPSEC
2010
146views more  COMPSEC 2010»
13 years 4 months ago
An intruder model with message inspection for model checking security protocols
Model checking security protocols is based on an intruder model that represents the eavesdropping or interception of the exchanged messages, while at the same time performs attack...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...
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