Skip to Main content Skip to Navigation
Conference papers

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

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.
Complete list of metadatas

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 : Tuesday, June 30, 2020 - 11:56:07 AM
Long-term archiving on: : Wednesday, May 21, 2014 - 11:51:32 AM

File

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

Identifiers

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⟩

Share

Metrics

Record views

293

Files downloads

234