A BSP Algorithm for On-the-fly Checking LTL Formulas on Security Protocols

Frederic Gava, Michael Guedj, Franck Pommereau
2012 2012 11th International Symposium on Parallel and Distributed Computing  
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.
doi:10.1109/ispdc.2012.10 dblp:conf/ispdc/GavaGP12 fatcat:zx65px4cc5a3zods2hccg76vxy