A Mechanized Model for CAN Protocols - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A Mechanized Model for CAN Protocols

(1, 2) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
main.pdf (424.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00802006 , version 1 (18-03-2013)

Identifiers

  • HAL Id : hal-00802006 , version 1

Cite

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⟩
221 View
179 Download

Share

Gmail Facebook Twitter LinkedIn More