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

From MaRDI portal
Publication:3457779

DOI10.1007/978-3-319-11936-6_5zbMATH Open1448.68051arXiv1505.05646OpenAlexW1504928881MaRDI QIDQ3457779FDOQ3457779


Authors: Timothy Bourke, Peter Höfner, Rob van Glabbeek Edit this on Wikidata


Publication date: 17 December 2015

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1505.05646




Recommendations




Cited In (5)

Uses Software





This page was built for publication: A mechanized proof of loop freedom of the (untimed) AODV routing protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457779)