Formal verification of standards for distance vector routing protocols

Journal of the ACM

Volumn 49, Issue 4, 2002, Pages 538-576

  Bhargavan, Karthikeyan ^a,b   Obradovic, Davor ^a,b   Gunter, Carl A ^a,b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

AODV; Distance vector routing; Formal verification; HOL; Interactive theorem proving; Model checking; Network standards; RIP; Routing protocols; SPIN

Indexed keywords

DISTANCE VECTAR ROUTING; FORMAL VERIFICATION; MODEL CHECKING; SPIN;

AUTOMATION; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SIMULATION; FORMAL LOGIC; MATERIALS HANDLING EQUIPMENT; MATHEMATICAL MODELS; NETWORK PROTOCOLS; THEOREM PROVING; WIRELESS TELECOMMUNICATION SYSTEMS;

ROUTERS;

EID: 0346263728     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/581771.581775     Document Type: Article

References (37)

1. BERTSEKAS, D. P., AND GALLAGER, R. 1991. Data Networks. Prentice Hall, Englewood Cliffs, N.J.
2. BHARGAVAN, K., GUNTER, C. A., KIM, M., LEE, I., OBRADOVIC, D., SOKOLSKY, O., AND VISWANATHAN, M. 2002. Verisim: Formal analysis of network simulations. IEEE Transactions on Software Engineering 28, 2 (Feb.), 129-145. Originally appeared in Proceedings of the International Symposium on Software Testing and Analysis (ISSTA, 2000). IEEE Computer Society Press, Los Alamitos, Calif.
3. BHARGAVAN, K., GUNTER, C. A., KIM, M., LEE, I., OBRADOVIC, D., SOKOLSKY, O., AND VISWANATHAN, M. 2002. Verisim: Formal analysis of network simulations. IEEE Transactions on Software Engineering 28, 2 (Feb.), 129-145. Originally appeared in Proceedings of the International Symposium on Software Testing and Analysis (ISSTA, 2000). IEEE Computer Society Press, Los Alamitos, Calif.
4. BHARGAVAN, K., GUNTER, C. A., AND OBRADOVIC, D. 2000a. An assessment of tools used in the Verinet Project. Technical Report MS-CIS-00-15, University of Pennsylvania, Philadelphia, Pa.
5. BHARGAVAN, K., GUNTER, C. A., AND OBRADOVIC, D. 2000b. A taxonomy of logical network analysis techniques. Technical Report MS-CIS-00-14, University of Pennsylvania, Philadelphia, Pa.
6. BHARGAVAN, K., GUNTER, C. A., AND OBRADOVIC, D. 2000c. Fault origin adjudication. In Formal Methods in Software Practice (FMSP' 00, Portland, Ore., Aug. 2000). ACM Press, New York.
7. CHIANG, C.-C. 1997. Routing in clustered multihop, mobile wireless networks with fading channel. In Proceedings of IEEE SICON '97 (April 1997). IEEE Computer Society Press, Los Alamitos, Calif., pp. 197-211.
8. CLARKE, E. M., GRUMBERG, O., AND LONG, D. E. 1994. Model checking and abstraction. ACM Trans. Program. Lang. Syst. 16, 5, 1512-1542.
9. CYPHER, D., LEE, D., MARTIN-VILLALBA, M., PRINS, C., AND SU, D. 1998. Formal specification, verification, and automatic test generation of ATM routing protocol: PNNI. In Formal Description Techniques & Protocol Specification, Testing, and Verification ((FORTE/PSTV) IFIP, Nov. 1998). Kluwer, Boston, Mass.
10. FREIER, A. O., KARLTON, P., AND KOCHER, P. C. 1996. Secure socket layer. IETF draft, Nov. Available online at home.netscape.com/eng/ss13.
11. GAO, L., AND REXFORD, J. 2000. Stable internet routing without global coordination. In ACM SIGMET-RICS (2000). ACM Press, New York.
12. GORDON, M. J. C., AND MELHAM, T. F., Eds. 1993. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, Cambridge, U.K.
13. GRIFFIN, T. G., AND WILFONG, G. 1999. An analysis of BGP convergence properties. In Proceedings of ACM SIGCOMM '99 Conference (Boston, Aug. 1999), G. Parulkar and J. S. Turner, Eds. ACM Press, New York, pp. 277-288.
14. GRIFFIN, T. G., AND WILFONG, G. 2000. A safe path vector protocol. In Proceedings of INFOCOM 2000 Conference (Tel Aviv, Israel, March 2000). IEEE Computer Society Press, Los Alamitos, Calif.
15. HEITMEYER, C., KIRBY, J., AND LABAW, B. 1998. Applying the SCR requirements method to a weapons control panel: An experience report. In Formal Methods in Software Practice (ACM SIGSOFT Conference, March 1998). ACM Press, New York.
16. HENDRICK, C. 1988. Routing Information Protocol. RFC 1058, IETF. Website: www.ietf.org.
17. HOLZMANN, G. J. 1991. Design and Validation of Computer Protocols. Prentice Hall, Englewood Cliffs, N.J.
18. HOLZMANN, G. J. 1997. The SPIN model checker. IEEE Trans. Softw. Eng. 23, 5 (May), 279-295.
19. HUITEMA, C. 1995. Routing in the Internet. Prentice Hall, Englewood Cliffs, N.J.
20. ISO 1990. Intermediate System to Intermediate System Intra-Domain Routing Exchange Protocol for Use in Conjunction with the Protocol for Providing the Connectionless-Mode Network Service. ISO 8473. Website: www.iso.org.
21. JACKSON, D., NG, Y., AND WING, J. 1999. A Nitpick analysis of mobile IPv6. Formal Aspects Comput. 11, 6 (Nov.), 591-615.
22. MALKIN, G. 1993. RIP, version 2: Carrying Additional Information. RFC 1388, IETF. Website: www.ietf.org.
23. MALKIN, G. 1994. RIP, version 2: Carrying Additional Information. RFC 1723, IETF. Website: www.ietf.org.
24. MANNA, Z., AND PNUELI, A. 1991. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, Berlin, Germany.
25. MITCHELL, J. C., SHMATIKOV, V., AND STERN, U. 1998. Finite-state analysis of SSL 3.0. In Seventh USENIX Security Symposium (San Antonio, 1998). USENIX, Berkeley, Calif., pp. 201-216.
26. MOY, J. 1994. OSPF, version 2. RFC 1583, IETF. Website: www.ietf.org.
27. MURTHY, S., AND GARCIA-LUNA-ACEVES, J. J. 1996. An efficient routing protocol for wireless networks. ACM Mobile Netw. Applicat. J. 1, 2 (Oct.), 183-197. (Special Issue on Routing in Mobile Communication Networks)
28. OBRADOVIC, D. 2002. Real-time model and convergence time of BGP. In Proceedings of IEEE INFOCOM 2002 (New York, June 2002), IEEE Computer Society Press, Los Alamitos, Calif.
29. PERKINS, C. E., AND BHAGWAT, P. 1994. Highly dynamic destination- sequenced distance-vector routing (DSDV) for mobile computers. In Proceedings of the ACM SIGCOMM'94 Conference on Communications Architectures, Protocols, and Applications (Sept. 1994). ACM Press, New York, pp. 234-244.
30. PERKINS, C. E., AND ROYER, E. M. 1998. Ad Hoc on-demand distance vector (AODV) Routing. Internet-Draft, version 2, IETF. Website: www.ietf.org.
31. PERKINS, C. E., AND ROYER, E. M. 1999. Ad-hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computer Systems and Applications (Feb. 1999). IEEE Computer Society Press, Los Alamitos, Calif., pp. 90-100.
32. PERLMAN, R. 1985. An algorithm for distributed computation of spanning trees in an extended LAN. In Proceedings of the Ninth Data Communications Symposium (Sept. 1985). ACM Press, New York, pp. 44-53.
33. PERLMAN, R. 1992. Interconnections: Bridges and Routers. Addison-Wesley, Reading, Mass.
34. REKHTER, Y., AND LI, T. 1995. A Border Gateway Protocol 4 (BGP-4). RFC 1771, IETF. Website: www.ietf.org.
35. ROYER, E. M., AND TOH, C.-K. 1999. A review of current routing protocols for ad hoc mobile wireless networks. IEEE Person. Commun. 6, 2 (April), 46-55.
36. VARADHAN, K., GOVINDAN, R., AND ESTRIN, D. 1996. Persistent route oscillations in inter-domain routing. ISI Technical Report 96-631. USC/Information Sciences Institute, Los Angeles, Calif.
37. WANG, B. Y., MESEGUER, J., AND GUNTER, C. A. 2000. Specification and Formal Verification of a PLAN Algorithm in Maude. In Proceedings of the 2000 ICDCS Workshop on Distributed System Validation and Verification (April 2000), T. Lai, Ed. IEEE Computer Society Press, Los Alamitos, Calif., pp. E:49-E:56.