Formal Verification of Netlog Protocols
Abstract
Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They greatly simplify the code, while still admitting efficient distributed execution, including on sensor networks. From previous work \cite{discotec11}, we know that they also provide a promising approach to another tough issue about distributed protocols: their formal verification. Indeed, we can take advantage of their data centric orientation, which allows us to explicitly handle global structures such as the topology of the network. We illustrate here our approach on two non-trivial protocols and discuss its Coq implementation.
Des languages orientés données basés sur des règles récursives ont été proposés pour programmer les applications distribuées sur des réseaux. Ils simplifient grandement le codage tout en admettant une exécution efficace. Ils offrent également une approche prometteuse pour les problèmes de verification qui sont délicats en distribué \cite{discotec11}. Nous illustrons ici notre approche sur deux protocoles non triviaux et discutons la mise en oeuvre de nore approche en Coq.
Origin : Files produced by the author(s)
Loading...