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

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.

arXiv commentThe Isabelle/HOL source files, and a full proof document, are available in the Archive of Formal Proofs, at http://afp.sourceforge.net/entries/AODV.shtml

References in corpus (5)

• The Inductive Approach to Verifying Cryptographic Protocols
• Verifying Safety Properties With the TLA+ Proof System
• Sequence Numbers Do Not Guarantee Loop Freedom; AODV Can Yield Routing Loops
• A mechanized proof of loop freedom of the (untimed) AODV routing protocol
• Showing invariance compositionally for a process algebra for network protocols

Cited by in corpus (5)

• Modelling and Verifying the AODV Routing Protocol
• A mechanized proof of loop freedom of the (untimed) AODV routing protocol
• Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack
• Formalising the Optimised Link State Routing Protocol
• Mechanizing a Process Algebra for Network Protocols