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

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

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

Abstract

This paper presents a distributed algorithm to compute on-the-fly whether a structured model of a security protocol satisfies or not a CTL* formula. The design of this simple and still efficient algorithm is possible by using the structured nature of security protocols. A prototype implementation has been developed, allowing to run benchmarks.
Fichier principal
Vignette du fichier
GGP-PDCAT-2012.pdf (153.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00950415 , version 1 (21-02-2014)

Identifiers

Cite

Frédéric Gava, Michael Guedj, Franck Pommereau. A BSP algorithm for on-the-fly checking CTL* formulas on security protocols. 13th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2012), Dec 2012, Beijing, China. pp.79--84, ⟨10.1109/PDCAT.2012.12⟩. ⟨hal-00950415⟩
139 View
97 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More