Skip to Main content Skip to Navigation
Journal articles

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

Abstract : This paper presents a distributed (Bulk-Synchronous Parallel or bsp) algorithm to compute on-the-fly whether a structured model of a security protocol satisfies a ctl {Mathematical expression} formula. Using the structured nature of the security protocols allows us to design a simple method to distribute the state space under consideration in a need-driven fashion. Based on this distribution of the states, the algorithm for logical checking of a ltl formula can be simplified and optimised allowing, with few tricky modifications, the design of an efficient algorithm for ctl {Mathematical expression} checking. Some prototype implementations have been developed, allowing to run benchmarks to investigate the parallel behaviour of our algorithms.
Complete list of metadatas

Cited literature [43 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00950399
Contributor : Frédéric Davesne <>
Submitted on : Tuesday, October 8, 2019 - 12:50:27 PM
Last modification on : Monday, October 28, 2019 - 11:00:24 AM

File

gava_pommereau_guedj.pdf
Files produced by the author(s)

Identifiers

Citation

Frédéric Gava, Franck Pommereau, Michael Guedj. A BSP algorithm for on-the-fly checking CTL* formulas on security protocols. Journal of Supercomputing, Springer Verlag, 2014, 69 (2), pp.629--672. ⟨10.1007/s11227-014-1099-8⟩. ⟨hal-00950399⟩

Share

Metrics

Record views

260

Files downloads

79