Abstract
We provide a proof using HOL and SPIN of convergence for the Routing Information Protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp realtime bound for this convergence. This extends existing results to deal with the RIP standard itself, which has complexities not accounted for in theorems about abstract versions of the protocol. Our work also provides a case study in the combined use of a higher-order theorem prover and a model checker. The former is used to express abstraction properties and inductions, and structure the high-level proof, while the latter deals efficiently with case analysis of finitary properties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dimitri P. Bertsekas and Robert Gallager. Data Networks. Prentice Hall, 1991.
Edmund M. Clarke and Jeannette M. Wing. Formal Methods: State of the Art and Future Directions. ACM Computing Surveys, 28(4):626–643, December 1996. report by the Working Group on Formal Methods for the ACM Workshop on Strategic Directions in Computing Research.
D. Cypher, D. Lee, M. Martin-Villalba, C. Prins, and D. Su. Formal Specification, Verification, and Automatic Test Generation of ATM Routing Protocol: PNNI. In Formal Description Techniques & Protocol Specification, Testing, and Verification (FORTE/PSTV) IFIP, November 1998.
J.J. Garcia-Luna-Aceves and Shree Murthy. A Loop-Free Path-Finding Algorithm: Specification, Verification and Complexity. In Proceedings of IEEE INFOCOM’ 95, April 1995.
M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
Timothy G. Griffin and Gordon Wilfong. An analysis of BGP convergence properties. In Guru Parulkar and Jonathan S. Turner, editors, Proceedings of ACM SIGCOMM’ 99 Conference, pages 277–288, Boston, August 1999.
Ahmed Helmy, Deborah Estrin, and Sandep Gupta. Fault-oriented Test Generation for Multicast Routing Protocol Design. In Formal Description Techniques & Protocol Specification, Testing, and Verification (FORTE/PSTV) IFIP, November 1998.
C. Hendrick. Routing information protocol. RFC 1058, IETF, June 1988.
Home page for the HOL interactive theorem proving system, http://www.cl.cam.ac.uk/Research/HVG/HOL.
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
Christian Huitema. Routing in the Internet. Prentice Hall, 1995.
G. Malkin. RIP Version 2 Carrying Additional Information. IETF RFC 1388, January 1993.
Abdel Mokkedem, Ravi Hosabettu, Michael D. Jones, and Ganesh Gopalakrishnan. Formalization and Analysis of a Solution to the PCI 2.1 Bus Transaction Ordering Problem. Formal Methods in System Design, 16(1):93–119, January 2000.
Olaf Müller and Tobias Nipkow. Combining model checking and deduction for i/o-automata. In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, May 1995.
Shree Murthy and J.J. Garcia-Luna-Aceves. An efficient routing protocol for wireless networks. ACM Mobile Netowrks and Applications Journal, October 1996. Special Issue on Routing in Mobile Communication Networks.
N. Shankar. PVS: Combining specification, proof checking, and model checking. In Mandayam Srivas and Albert Camilleri, editors, Formal Methods in Computer-Aided Design (FMCAD’ 96), volume 1166 of Lecture Notes in Computer Science, pages 257–264, Palo Alto, CA, November 1996. Springer-Verlag.
Home page for the SPIN model checker. http://netlib.bell-labs.com/netlib/spin/whatispin.html.
Bow-Yaw Wang, José Meseguer, and Carl A. Gunter. Specification and formal verification of a PLAN algorithm in Maude. In Proceedings of the International workshop on Distributed System Valdiation and Verification, pages E:49–E:56. IEEE Computer Society Press, April 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhargavan, K., Gunter, C.A., Obradovic, D. (2000). Routing Information Protocol in HOL/SPIN. In: Aagaard, M., Harrison, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2000. Lecture Notes in Computer Science, vol 1869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44659-1_4
Download citation
DOI: https://doi.org/10.1007/3-540-44659-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67863-2
Online ISBN: 978-3-540-44659-0
eBook Packages: Springer Book Archive