HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
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 metadata

Cited literature [43 references]  Display  Hide  Download

Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Tuesday, October 8, 2019 - 12:50:27 PM
Last modification on : Friday, October 22, 2021 - 4:41:37 AM


Files produced by the author(s)



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⟩



Record views


Files downloads