A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 theirdoi:10.1109/pdcat.2012.93 dblp:conf/pdcat/GavaHF12 fatcat:dhsylybaznhf5ondi2znwwjnqe