Routing information protocol in hol/spin

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1869, Issue , 2000, Pages 53-72

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

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING; ROUTING PROTOCOLS;

CASE ANALYSIS; DISTANCE VECTOR ROUTING; FINITARY PROPERTY; HIGHER-ORDER; MODEL CHECKER; REAL TIME; ROUTING INFORMATION PROTOCOLS; THEOREM PROVERS;

THEOREM PROVING;

EID: 77954002789     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44659-1_4     Document Type: Conference Paper

References (18)

1. Dimitri P. Bertsekas and Robert Gallager. Data Networks. Prentice Hall, 1991.
2. 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.
3. 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.
4. 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.
5. M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
6. 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.
7. 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.
8. C. Hendrick. Routing information protocol. RFC 1058, IETF, June 1988.
9. Home page for the HOL interactive theorem proving system. http://www.cl.cam.ac.uk/Research/HVG/HOL.
10. Gerard J. Holzmann Design and Validation of Computer Protocols. Prentice Hall, 1991.
11. Christian Huitema. Routing in the Internet. Prentice Hall, 1995.
12. G. Malkin. RIP Version 2 Carrying Additional Information. IETF RFC 1388, January 1993.
13. 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.
14. Olaf Miiller 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.
15. 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.
16. 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.
17. Home page for the SPIN model checker, http://netlib.bell-labs.com/netlib/spin/whatispin.html.
18. Bow-Yaw Wang, Jose 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.