@inproceedings{'DGM1',
title = {{A Framework for Verifying Data-Centric Protocols} },
author = {Deng, Yuxin and Grumbach, St\'ephane and Monin, Jean-Fran\c{c}ois},
month = {June 6-9},
year = {2011},
booktitle = {FMOODS/FORTE 2011},
address = {Reykjavik, Iceland},
pages = {106-120},
publisher = {Springer},
series = {LNCS},
volume = {6722},
team = {PACSS},
pdf = {Docs/discotec11.pdf},
abstract = {Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, which is orders of magnitude shorter, much more declarative, while still admitting efficient distributed execution. We show that they also provide a promising approach to the verification of distributed protocols, thanks to their data centric orientation, which allows to explicitly handle global structures, such as the topology of the network, routing tables, trees, etc, as well as their properties. We consider a framework using an original formalization in the Coq proof assistant of a distributed computation model based on message passing with either synchronous or asynchronous behavior. The declarative rules of the Netlog language for specifying distributed protocols, as well as the virtual machines for evaluating these rules, are encoded in Coq as well. We consider as a case study tree protocols, and show how this framework enables us to formally verify them in both the asynchronous and synchronous setting.},
}
