A Framework for Verifying Data-Centric Protocols - Formal Techniques for Distributed Systems Access content directly
Conference Papers Year : 2011

A Framework for Verifying Data-Centric Protocols

Yuxin Deng
  • Function : Author
  • PersonId : 874480
Stéphane Grumbach

Abstract

Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, 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 us to explicitly handle global structures such as the topology of the network. 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 and 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.
Fichier principal
Vignette du fichier
vdcp.pdf (315.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00647802 , version 1 (02-12-2011)

Licence

Attribution

Identifiers

Cite

Yuxin Deng, Stéphane Grumbach, Jean-François Monin. A Framework for Verifying Data-Centric Protocols. 13th Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 31th International Conference on FORmal TEchniques for Networked and Distributed Systems (FORTE), Jun 2011, Reykjavik, Iceland. pp.106-120, ⟨10.1007/978-3-642-21461-5_7⟩. ⟨hal-00647802⟩
1061 View
174 Download

Altmetric

Share

Gmail Facebook X LinkedIn More