A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol

Résumé

The (AODV) routing protocol allows the nodes in a (MANET) or a (WMN) to know where to forward data packets. Such a protocol is ‘loop free’ if it never leads to routing decisions that forward packets in circles. This paper describes the mechanization of an existing pen-and-paper proof of loop freedom of AODV in the interactive theorem prover Isabelle/HOL. The mechanization relies on a novel compositional approach for lifting invariants to networks of nodes. We exploit the mechanization to analyse several improvements of AODV and show that Isabelle/HOL can re-establish most proof obligations automatically and identify exactly the steps that are no longer valid.

Dates et versions

hal-01092360 , version 1 (08-12-2014)

Identifiants

Citer

Timothy Bourke, Robert J. van Glabbeek, Peter Höfner. A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol. ATVA 2014: Automated Technology for Verification and Analysis, Nov 2014, Sydney, Australia. pp.17, ⟨10.1007/978-3-319-11936-6_5⟩. ⟨hal-01092360⟩
179 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More