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

Frédéric Gava 1 Franck Pommereau 2 Michael Guedj 1
IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
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.
Liste complète des métadonnées

Contributor : Frédéric Davesne <>
Submitted on : Friday, February 21, 2014 - 1:40:43 PM
Last modification on : Thursday, February 7, 2019 - 4:59:20 PM

Links full text



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