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

Frédéric Gava (1) , Michael Guedj (1) , Franck Pommereau (2)

1 LACL - Laboratoire d'Algorithmique Complexité et Logique
2 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes

This paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute on-the-fly whether a structured model of a security protocol satisfies a LTL formula. Using the structured nature of the security protocols allows us to design a simple and efficient parallelisation of an algorithm which constructs the state-space under consideration in a need-driven fashion. A prototype implementation has been developed, allowing to run benchmarks.

Keywords: BSP; LTL; Security Protocols

Domains: Discrete Mathematics [cs.DM]

Frédéric Gava, Michael Guedj, Franck Pommereau. A BSP algorithm for on-the-fly checking LTL formulas on security protocols. 11th International Symposium on Parallel and Distributed Computing (ISPDC 2012), Jun 2012, Munich/Garching, Bavaria, Germany. pp.11--18, ⟨10.1109/ISPDC.2012.10⟩. ⟨hal-00868689⟩