Mechanised Verification of Distributed State-Space Algorithms for Security Protocols

Frederic Gava, Arthur Hidalgo, Jean Fortin
2012 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies  
Explicit model-checking (MC) is a classical solution to find flaws in a security protocol. But it is wellknown that for non trivial protocols, MC may enumerate statespaces of astronomical sizes -the famous state-space explosion problem. Distributed model checking is a solution but complex and subject to bugs: a MC can validate a model but miss an invalid state. In this paper, we focus on using a verification condition generator that takes annotated distributed algorithms and ensures their
more » ... ation and correctness. We study five algorithms (one sequential and four distributed where three of them are dedicated and optimised for security protocol) of state-space construction as a first step towards mechanised verification of distributed model-checkers.
doi:10.1109/pdcat.2012.93 dblp:conf/pdcat/GavaHF12 fatcat:dhsylybaznhf5ondi2znwwjnqe