A mechanized proof of loop freedom of the (untimed) AODV routing protocol
| Autor: | Bourke, Timothy, van Glabbeek, Robert J., Höfner, Peter |
|---|---|
| Rok vydání: | 2015 |
| Předmět: | |
| Zdroj: | Proc. Automated Technology for Verification and Analysis, ATVA 2014 (F. Cassez and J.-F. Raskin, eds.), LNCS 8837, Springer, 2014, pp. 47-63 |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1007/978-3-319-11936-6_5 |
| Popis: | 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. Comment: The 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 |
| Databáze: | arXiv |
| Externí odkaz: |
|