 |
Free and accessible knowledge |
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.
Cited literature [33 references]
https://hal.archives-ouvertes.fr/hal-00868689
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
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
File
GGP-ISPDC-2012.pdf
Files produced by the author(s)