A Framework for Verifying Data-Centric Protocols
International audience 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 t...
Main Authors: | , , |
---|---|
Other Authors: | , , , , , , , , , , , , , |
Format: | Conference Object |
Language: | English |
Published: |
HAL CCSD
2011
|
Subjects: | |
Online Access: | https://inria.hal.science/hal-00647802 https://inria.hal.science/hal-00647802/document https://inria.hal.science/hal-00647802/file/vdcp.pdf https://doi.org/10.1007/978-3-642-21461-5_7 |
id |
ftifiphal:oai:HAL:hal-00647802v1 |
---|---|
record_format |
openpolar |
institution |
Open Polar |
collection |
IFIP Open Digital Library (International Federation for Information Processing) |
op_collection_id |
ftifiphal |
language |
English |
topic |
[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC] |
spellingShingle |
[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC] Deng, Yuxin Grumbach, Stéphane Monin, Jean-François A Framework for Verifying Data-Centric Protocols |
topic_facet |
[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC] |
description |
International audience 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. |
author2 |
BASICS (BASICS) Shanghai Jiao Tong University Shanghai NETQUEST (NETQUEST) Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Inria Paris-Rocquencourt Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de la Recherche Agronomique (INRA)-Chinese Academy of Sciences Changchun Branch (CAS)-Institute of Automation - Chinese Academy of Sciences-Centre National de la Recherche Scientifique (CNRS) Formal Methods for Embedded Systems (FORMES) Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées (LIAMA) Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Institut National de la Recherche Agronomique (INRA)-Chinese Academy of Sciences Changchun Branch (CAS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institute of Automation - Chinese Academy of Sciences-Centre National de la Recherche Scientifique (CNRS)-Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Institut National de la Recherche Agronomique (INRA)-Chinese Academy of Sciences Changchun Branch (CAS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institute of Automation - Chinese Academy of Sciences-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt Institut National de Recherche en Informatique et en Automatique (Inria) Université Joseph Fourier - Grenoble 1 (UJF) Roberto Bruni Juergen Dingel TC 6 WG 6.1 |
format |
Conference Object |
author |
Deng, Yuxin Grumbach, Stéphane Monin, Jean-François |
author_facet |
Deng, Yuxin Grumbach, Stéphane Monin, Jean-François |
author_sort |
Deng, Yuxin |
title |
A Framework for Verifying Data-Centric Protocols |
title_short |
A Framework for Verifying Data-Centric Protocols |
title_full |
A Framework for Verifying Data-Centric Protocols |
title_fullStr |
A Framework for Verifying Data-Centric Protocols |
title_full_unstemmed |
A Framework for Verifying Data-Centric Protocols |
title_sort |
framework for verifying data-centric protocols |
publisher |
HAL CCSD |
publishDate |
2011 |
url |
https://inria.hal.science/hal-00647802 https://inria.hal.science/hal-00647802/document https://inria.hal.science/hal-00647802/file/vdcp.pdf https://doi.org/10.1007/978-3-642-21461-5_7 |
op_coverage |
Reykjavik, Iceland |
genre |
Iceland |
genre_facet |
Iceland |
op_source |
Lecture Notes in Computer Science 13th Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 31th International Conference on FORmal TEchniques for Networked and Distributed Systems (FORTE) https://inria.hal.science/hal-00647802 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⟩ http://hal.inria.fr/docs/00/64/78/02/PDF/vdcp.pdf |
op_relation |
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-21461-5_7 hal-00647802 https://inria.hal.science/hal-00647802 https://inria.hal.science/hal-00647802/document https://inria.hal.science/hal-00647802/file/vdcp.pdf doi:10.1007/978-3-642-21461-5_7 PRODINRA: 245868 |
op_rights |
http://creativecommons.org/licenses/by/ info:eu-repo/semantics/OpenAccess |
op_doi |
https://doi.org/10.1007/978-3-642-21461-5_7 |
container_start_page |
106 |
op_container_end_page |
120 |
_version_ |
1797585493457633280 |
spelling |
ftifiphal:oai:HAL:hal-00647802v1 2024-04-28T08:25:50+00:00 A Framework for Verifying Data-Centric Protocols Deng, Yuxin Grumbach, Stéphane Monin, Jean-François BASICS (BASICS) Shanghai Jiao Tong University Shanghai NETQUEST (NETQUEST) Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Inria Paris-Rocquencourt Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de la Recherche Agronomique (INRA)-Chinese Academy of Sciences Changchun Branch (CAS)-Institute of Automation - Chinese Academy of Sciences-Centre National de la Recherche Scientifique (CNRS) Formal Methods for Embedded Systems (FORMES) Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées (LIAMA) Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Institut National de la Recherche Agronomique (INRA)-Chinese Academy of Sciences Changchun Branch (CAS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institute of Automation - Chinese Academy of Sciences-Centre National de la Recherche Scientifique (CNRS)-Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Institut National de la Recherche Agronomique (INRA)-Chinese Academy of Sciences Changchun Branch (CAS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institute of Automation - Chinese Academy of Sciences-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt Institut National de Recherche en Informatique et en Automatique (Inria) Université Joseph Fourier - Grenoble 1 (UJF) Roberto Bruni Juergen Dingel TC 6 WG 6.1 Reykjavik, Iceland 2011-06-06 https://inria.hal.science/hal-00647802 https://inria.hal.science/hal-00647802/document https://inria.hal.science/hal-00647802/file/vdcp.pdf https://doi.org/10.1007/978-3-642-21461-5_7 en eng HAL CCSD Springer info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-21461-5_7 hal-00647802 https://inria.hal.science/hal-00647802 https://inria.hal.science/hal-00647802/document https://inria.hal.science/hal-00647802/file/vdcp.pdf doi:10.1007/978-3-642-21461-5_7 PRODINRA: 245868 http://creativecommons.org/licenses/by/ info:eu-repo/semantics/OpenAccess Lecture Notes in Computer Science 13th Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 31th International Conference on FORmal TEchniques for Networked and Distributed Systems (FORTE) https://inria.hal.science/hal-00647802 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⟩ http://hal.inria.fr/docs/00/64/78/02/PDF/vdcp.pdf [INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC] info:eu-repo/semantics/conferenceObject Conference papers 2011 ftifiphal https://doi.org/10.1007/978-3-642-21461-5_7 2024-04-09T14:41:03Z International audience 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. Conference Object Iceland IFIP Open Digital Library (International Federation for Information Processing) 106 120 |