Distributed Algorithms
A Validation Model for the DSR Protocol
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Roadmap for enhanced languages and methods to aid verification
Proceedings of the 5th international conference on Generative programming and component engineering
Logics of Specification Languages (Monographs in Theoretical Computer Science. An EATCS Series)
Logics of Specification Languages (Monographs in Theoretical Computer Science. An EATCS Series)
Developing Topology Discovery in Event-B
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Modeling in Event-B: System and Software Engineering
Modeling in Event-B: System and Software Engineering
| Hi-index | 0.00 |
This paper presents an incremental formal development of the Dynamic Source Routing (DSR) protocol in Event-B. DSR is a reactive routing protocol, which finds a route for a destination on demand, whenever communication is needed. Route discovery is an important task of any routing algorithm and formal specification of it, itself is a challenging problem. The specification is performed in a stepwise manner composing more advanced routing components between the abstract specification and topology. It is verified through a series of refinements. The specification includes safety properties as set of invariants, and liveness properties that characterize when the system reaches stable states. We establish these properties by proof of invariants, event refinement and deadlock freedom. The consequence of this incremental approach helps to achieve a high degree of automatic proof. Our approach can be useful for formalizing and developing other kinds of reactive routing protocols (i.e. AODV etc.).