A mechanized model for CAN protocols

  • Authors:
  • Francesco Bongiovanni;Ludovic Henrio

  • Affiliations:
  • LIG Labs, Joseph Fourier University, Grenoble, France;INRIA-I3S-CNRS, University of Nice Sophia Antipolis, France

  • Venue:
  • FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

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.