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.
Type de document :
Communication dans un congrès
9th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC, affiliated to conference SPIN 2010), Sep 2010, Enschede, Netherlands. pp.37--44, 2011, 〈10.1109/PDMC-HiBi.2010.14〉
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-00669177
Contributeur : Frédéric Davesne <>
Soumis le : samedi 11 février 2012 - 20:36:56
Dernière modification le : jeudi 13 décembre 2018 - 09:46:03

Identifiants

Collections

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, 2011, 〈10.1109/PDMC-HiBi.2010.14〉. 〈hal-00669177〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

90

Contact

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