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

@inproceedings{Bourke2014AMP,
  title={A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol},
  author={T. Bourke and R. V. Glabbeek and P. H{\"o}fner},
  booktitle={ATVA},
  year={2014}
}
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… Expand
Loop freedom of the (untimed) AODV routing protocol
TLDR
This development mechanises an existing pen-and-paper proof of loop freedom of AODV and shows that Isabelle/HOL can re-establish most proof obligations automatically and identify exactly the steps that are no longer valid. Expand
Formal verification of opportunistic routing protocol using SPIN model checker
TLDR
Formal verification of ORPSN protocol using SPIN model checker tool shows that, ORPSn protocol works correctly as per its standard specification, and generates a formal model of specified protocol that confirms that, the protocol works without any error. Expand
Reliable Restricted Process Theory
TLDR
This work examines the effects of this adaptation on the semantics of the framework with regard to the non-blocking property of communication in MANETs, the notion of behavioral equivalence relation and its axiomatization, and introduces a novel proof process, based on a precongruence relation. Expand
Modelling and verifying the AODV routing protocol
This paper presents a formal specification of the Ad hoc On-demand Distance Vector (AODV) routing protocol using AWN (Algebra for Wireless Networks), a recent process algebra which has been tailoredExpand
Showing Invariance Compositionally for a Process Algebra for Network Protocols
This paper presents the mechanization of a process algebra for Mobile Ad hoc Networks and Wireless Mesh Networks, and the development of a compositional framework for proving invariant properties.Expand
Mechanizing a Process Algebra for Network Protocols
This paper presents the mechanization of a process algebra for Mobile Ad hoc Networks and Wireless Mesh Networks, and the development of a compositional framework for proving invariant properties.Expand
Formalising the Optimised Link State Routing Protocol
TLDR
This paper uses the timed process algebra T-AWN for modelling the Optimised Link State Routing protocol (OLSR) version 2.0, which aims to provide more precise and verifiable descriptions of protocols. Expand
Model checking mobile ad hoc networks
TLDR
A model checking algorithm is presented to verify MANETs that allow arbitrary mobility, under the assumption of reliable communication, and is applied to analyze a leader election protocol. Expand
Formal modeling and analysis of ad hoc Zone Routing Protocol in Event-B
TLDR
This paper formally analyze the Zone Routing Protocol (ZRP), a hybrid routing framework, using Event-B, and develops the formal specification by the refinement mechanism, which allows it to gradually model the network environment, the construction of routing zones, route discovery based on bordercasting service and routing update. Expand
Using Process Algebra to Design Better Protocols
TLDR
A combination of pen-and-paper analysis, model checking and interactive theorem proving has helped to perform a formal analysis of the Ad hoc On-Demand Vector (AODV) routing protocol. Expand
...
1
2
...

References

SHOWING 1-10 OF 29 REFERENCES
Loop freedom of the (untimed) AODV routing protocol
TLDR
This development mechanises an existing pen-and-paper proof of loop freedom of AODV and shows that Isabelle/HOL can re-establish most proof obligations automatically and identify exactly the steps that are no longer valid. Expand
Formal verification of standards for distance vector routing protocols
TLDR
This work shows how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols, and develops verification techniques suited to routing protocols generally. Expand
The proof of AODV loop freedom
TLDR
This paper gives a formal description of the AODV protocol and presents a strictly formal proof of its loop freedom property in Isabelle/HOL, demonstrating the feasibility of completely formal verification of some properties of routing protocols with reasonable effort. Expand
Showing Invariance Compositionally for a Process Algebra for Network Protocols
This paper presents the mechanization of a process algebra for Mobile Ad hoc Networks and Wireless Mesh Networks, and the development of a compositional framework for proving invariant properties.Expand
Sequence numbers do not guarantee loop freedom: AODV can yield routing loops
TLDR
It is shown that AODV is not a priori loop free; in fact, loop freedom hinges on non-evident assumptions to be made when resolving ambiguities occurring in the RFC. Expand
Mechanization of the Algebra for Wireless Networks (AWN)
  • T. Bourke
  • Computer Science
  • Arch. Formal Proofs
  • 2014
TLDR
This development mechanises the original operational semantics of AWN and introduces a variant 'open' operational semantics that enables the compositional statement and proof of invariants across distinct network nodes. Expand
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV
TLDR
A rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) protocol, a popular routing protocol designed for MANETs and WMNs, and one of the four protocols currently standardised by the IETF MANET working group is presented. Expand
A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions
A formalisation of π-calculus in the Coq system is presented. Based on a de Bruijn notation for names, our implementation exploits the mechanisation of some proof techniques described by Sangiorgi inExpand
Concurrency Verification: Introduction to Compositional and Noncompositional Methods
This is a systematic and comprehensive introduction both to compositional proof methods for the state-based verification of concurrent programs, such as the assumption-commitment and rely-guaranteeExpand
Isabelle/Circus: A Process Specification and Verification Environment
TLDR
A machine-checked, formal semantics based on a "shallow embedding" of Circus in Isabelle/UTP is developed, which derives proof rules from this semantics and implements tactic support that finally allows for proofs of refinement for Circus processes. Expand
...
1
2
3
...