A BSP algorithm for on-the-fly checking LTL formulas on security protocols

Frédéric Gava 1 Michael Guedj 1 Franck Pommereau 2
1 LACL - Laboratoire d'Algorithmique Complexité et Logique
2 COSMO
IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
Abstract : This paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute on-the-fly whether a structured model of a security protocol satisfies a LTL formula. Using the structured nature of the security protocols allows us to design a simple and efficient parallelisation of an algorithm which constructs the state-space under consideration in a need-driven fashion. A prototype implementation has been developed, allowing to run benchmarks.
Keywords : BSP LTL Security Protocols
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [33 references]  Display  Hide  Download
https://hal.archives-ouvertes.fr/hal-00868689
Contributor : Frédéric Davesne <>
Submitted on : Sunday, February 16, 2014 - 2:58:34 PM
Last modification on : Thursday, February 7, 2019 - 4:32:56 PM
Document(s) archivé(s) le : Friday, May 16, 2014 - 10:36:16 AM

File

GGP-ISPDC-2012.pdf
Files produced by the author(s)

Identifiers

Collections

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

Citation

Frédéric Gava, Michael Guedj, Franck Pommereau. A BSP algorithm for on-the-fly checking LTL formulas on security protocols. 11th International Symposium on Parallel and Distributed Computing (ISPDC 2012), Jun 2012, Munich/Garching, Bavaria, Germany. pp.11--18, ⟨10.1109/ISPDC.2012.10⟩. ⟨hal-00868689⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

414

Files downloads

305

Contact

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