A mechanized proof of loop freedom of the (untimed) AODV routing protocol

Timothy Bourke, Rob van Glabbeek, Peter Höfner, Rob van Glabbeek

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The Ad hoc On-demand Distance Vector (AODV) routing protocol allows the nodes in a Mobile Ad hoc Network (MANET) or a Wireless Mesh Network (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.

Original languageEnglish
Title of host publicationAutomated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014, Proceedings
EditorsFranck Cassez, Jean-François Raskin
PublisherSpringer Verlag
Pages47-63
Number of pages17
ISBN (Electronic)9783319119359
DOIs
Publication statusPublished - 1 Jan 2014
Event12th International Symposium on Automated Technology for Verification and Analysis, ATVA 2014 - Sydney, Australia
Duration: 3 Nov 20147 Nov 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8837
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Symposium on Automated Technology for Verification and Analysis, ATVA 2014
Country/TerritoryAustralia
CitySydney
Period3/11/147/11/14

Fingerprint

Dive into the research topics of 'A mechanized proof of loop freedom of the (untimed) AODV routing protocol'. Together they form a unique fingerprint.

Cite this