A BSP Algorithm for the State Space Construction of Security Protocols

Frédéric Gava 1 Michael Guedj 1 Franck Pommereau 2
1 LACL - Laboratoire d'Algorithmique Complexité et Logique
2 LIS
IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
Abstract : This paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute the discrete state space of structured models of security protocols. The BSP model of parallelism avoids concurrency related problems (mainly deadlocks and non-determinism) and allows us to design an efficient algorithm that is at the same time simple to express. A prototype implementation has been developed, allowing to run benchmarks showing the benefits of our algorithm.
Document type :
Conference papers
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-00669177
Contributor : Frédéric Davesne <>
Submitted on : Saturday, February 11, 2012 - 8:36:56 PM
Last modification on : Wednesday, January 23, 2019 - 1:48:04 PM

Identifiers

Collections

UNIV-EVRY | LACL | UPEC | UPEC-UPEM | IBISC-COSMO | IBISC

Citation

Frédéric Gava, Michael Guedj, Franck Pommereau. A BSP Algorithm for the State Space Construction of Security Protocols. 9th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC, affiliated to conference SPIN 2010), Sep 2010, Enschede, Netherlands. pp.37--44, ⟨10.1109/PDMC-HiBi.2010.14⟩. ⟨hal-00669177⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

93

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD