A BSP algorithm for on-the-fly checking CTL* 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 distributed algorithm to compute on-the-fly whether a structured model of a security protocol satisfies or not a CTL* formula. The design of this simple and still efficient algorithm is possible by using the structured nature of security protocols. A prototype implementation has been developed, allowing to run benchmarks.
Keywords : BSP CTL Security Protocols
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download
https://hal.archives-ouvertes.fr/hal-00950415
Contributor : Frédéric Davesne <>
Submitted on : Friday, February 21, 2014 - 1:58:45 PM
Last modification on : Thursday, February 7, 2019 - 4:02:08 PM
Document(s) archivé(s) le : Wednesday, May 21, 2014 - 11:51:32 AM

File

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

Identifiers

Collections

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

Citation

Frédéric Gava, Michael Guedj, Franck Pommereau. A BSP algorithm for on-the-fly checking CTL* formulas on security protocols. 13th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2012), Dec 2012, Beijing, China. pp.79--84, ⟨10.1109/PDCAT.2012.12⟩. ⟨hal-00950415⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

173

Files downloads

86

Contact

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