Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

ACSD
2010
IEEE

favoriteEmaildiscussreport

261views Hardware» more ACSD 2010»

Partial Order Reduction for Branching Security Protocols

13 years 7 months ago

Partial Order Reduction for Branching Security Protocols

Download www.win.tue.nl

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 proposed algorithm in both model checking and constraint solving approaches are discussed. We also report some experimental results using a

Wan Fokkink, Mohammad Torabi Dashti, Anton Wijs

Real-time Traffic

ACSD 2010 | Clarke Et | Exchange Protocols | Hardware | Order Reduction Algorithm |

claim paper

Related Content

» Checking Secrecy by Means of Partial Order Reduction

» Partial Order Reduction for Probabilistic Branching Time

» An intruder model with message inspection for model checking security protocols

» Partial Order Reductions for Bisimulation Checking

» Partial Order Reductions Using Compositional Confluence Detection

» On Reduction Criteria for Probabilistic Reward Models

» ClusterBased PartialOrder Reduction

» Security and Productivity Improvements Sufficient for the Success of Secure Electronic Tr...

» Secure Evaluation of Private Linear Branching Programs with Medical Applications

Post Info
More Details (n/a)

Added	10 Feb 2011
Updated	10 Feb 2011
Type	Journal
Year	2010
Where	ACSD
Authors	Wan Fokkink, Mohammad Torabi Dashti, Anton Wijs

Comments (0)