Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Sunday, February 16, 2014 - 2:58:34 PM
Last modification on : Tuesday, October 19, 2021 - 4:07:09 PM
Long-term archiving on: : Friday, May 16, 2014 - 10:36:16 AM


Files produced by the author(s)



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⟩



Record views


Files downloads