A BSP algorithm for on-the-fly checking LTL formulas on security protocols - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

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

(1) , (1) , (2)
1
2

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.

Keywords

Fichier principal
Vignette du fichier
GGP-ISPDC-2012.pdf (140.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00868689 , version 1 (16-02-2014)

Identifiers

Cite

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⟩
254 View
239 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More