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

  • Timothy Bourke
  • Rob van Glabbeek
  • Peter Höfner
Conference paper

DOI: 10.1007/978-3-319-11936-6_5

Volume 8837 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Bourke T., van Glabbeek R., Höfner P. (2014) A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol. In: Cassez F., Raskin JF. (eds) Automated Technology for Verification and Analysis. ATVA 2014. Lecture Notes in Computer Science, vol 8837. Springer, Cham

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Timothy Bourke
    • 1
    • 2
  • Rob van Glabbeek
    • 3
    • 4
  • Peter Höfner
    • 3
    • 4
  1. 1.INRIA Paris-RocquencourtFrance
  2. 2.Ecole normale supérieureParisFrance
  3. 3.NICTAAustralia
  4. 4.Computer Science and EngineeringUNSWAustralia