Skip to Main content Skip to Navigation
Conference papers

A Mechanized Model for CAN Protocols

Francesco Bongiovanni 1, 2 Ludovic Henrio 3
3 OASIS - Active objects, semantics, Internet and security
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Formal reasoning on Peer-to-Peer (P2P) systems is an intimidating task. This paper focuses on broadcast algorithms for Content Addressable Network (CAN). Since these algorithms run on top of complex P2P systems, finding the right level of abstraction in order to prove their functional correctness is difficult. This paper presents a mechanized model for both CAN and broadcast protocols over those networks. We demonstrate that our approach is practical by identifying sufficient conditions for a protocol to be correct and efficient. We also prove the existence of a protocol verifying those properties.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00802006
Contributor : Ludovic Henrio <>
Submitted on : Monday, March 18, 2013 - 6:58:02 PM
Last modification on : Thursday, November 19, 2020 - 12:59:34 PM
Long-term archiving on: : Sunday, April 2, 2017 - 2:38:53 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00802006, version 1

Collections

Citation

Francesco Bongiovanni, Ludovic Henrio. A Mechanized Model for CAN Protocols. 16th International Conference on Fundamental Approaches to Software Engineering (FASE'13), Mar 2013, Rome, Italy. ⟨hal-00802006⟩

Share

Metrics

Record views

501

Files downloads

398