Partial order reduction for branching security protocols

W.J. Fokkink; M. Torabi Dashti; A.J. Wijs

doi:10.1109/ACSD.2010.19

Partial order reduction for branching security protocols

W.J. Fokkink
, M. Torabi Dashti
, A.J. Wijs

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

5 Citaten (Scopus)

Samenvatting

Two extensions of the partial order reduction algorithm of Clarke, Jha and Marrero are presented. The proposed algorithms are suitable for branching security protocols, e.g. optimistic fair contract signing schemes. The first extension is proved to generate a reduced state space which is branching bisimilar to the full state space, while the second extension generates a state space that is trace equivalent to the full state space. Experimental results using an implementation of the algorithms in the toolset of the µCRL process algebra are reported.

Originele taal-2	Engels
Titel	Proceedings 10th International Conference on Application of Concurrency to System Design (ACSD'10, Braga, Portugal, June 21-25, 2010)
Uitgeverij	IEEE Computer Society
Pagina's	191-200
ISBN van geprinte versie	978-1-4244-7266-6
DOI's	https://doi.org/10.1109/ACSD.2010.19
Status	Gepubliceerd - 2010

Toegang tot document

10.1109/ACSD.2010.19

Citeer dit

@inproceedings{24dedc9a1ead46128bb065fae510825a,

title = "Partial order reduction for branching security protocols",

abstract = "Two extensions of the partial order reduction algorithm of Clarke, Jha and Marrero are presented. The proposed algorithms are suitable for branching security protocols, e.g. optimistic fair contract signing schemes. The first extension is proved to generate a reduced state space which is branching bisimilar to the full state space, while the second extension generates a state space that is trace equivalent to the full state space. Experimental results using an implementation of the algorithms in the toolset of the µCRL process algebra are reported.",

author = "W.J. Fokkink and \{Torabi Dashti\}, M. and A.J. Wijs",

year = "2010",

doi = "10.1109/ACSD.2010.19",

language = "English",

isbn = "978-1-4244-7266-6",

pages = "191--200",

booktitle = "Proceedings 10th International Conference on Application of Concurrency to System Design (ACSD'10, Braga, Portugal, June 21-25, 2010)",

publisher = "IEEE Computer Society",

address = "United States",

}

Partial order reduction for branching security protocols. / Fokkink, W.J.; Torabi Dashti, M.; Wijs, A.J.
Proceedings 10th International Conference on Application of Concurrency to System Design (ACSD'10, Braga, Portugal, June 21-25, 2010). IEEE Computer Society, 2010. blz. 191-200.

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

TY - GEN

T1 - Partial order reduction for branching security protocols

AU - Fokkink, W.J.

AU - Torabi Dashti, M.

AU - Wijs, A.J.

PY - 2010

Y1 - 2010

N2 - Two extensions of the partial order reduction algorithm of Clarke, Jha and Marrero are presented. The proposed algorithms are suitable for branching security protocols, e.g. optimistic fair contract signing schemes. The first extension is proved to generate a reduced state space which is branching bisimilar to the full state space, while the second extension generates a state space that is trace equivalent to the full state space. Experimental results using an implementation of the algorithms in the toolset of the µCRL process algebra are reported.

AB - Two extensions of the partial order reduction algorithm of Clarke, Jha and Marrero are presented. The proposed algorithms are suitable for branching security protocols, e.g. optimistic fair contract signing schemes. The first extension is proved to generate a reduced state space which is branching bisimilar to the full state space, while the second extension generates a state space that is trace equivalent to the full state space. Experimental results using an implementation of the algorithms in the toolset of the µCRL process algebra are reported.

U2 - 10.1109/ACSD.2010.19

DO - 10.1109/ACSD.2010.19

M3 - Conference contribution

SN - 978-1-4244-7266-6

SP - 191

EP - 200

BT - Proceedings 10th International Conference on Application of Concurrency to System Design (ACSD'10, Braga, Portugal, June 21-25, 2010)

PB - IEEE Computer Society

ER -

Partial order reduction for branching security protocols

Samenvatting

Toegang tot document

Vingerafdruk

Citeer dit