Stenning's protocol implemented in UDP and verified in Isabelle

Conferences in Research and Practice in Information Technology Series

Volumn 41, Issue , 2005, Pages

  Compton, Michael ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Distributed systems; Formal verification; Theorem proving

Indexed keywords

ABSTRACT REPRESENTATION; DISTRIBUTED PROGRAM; DISTRIBUTED SYSTEMS; EXECUTION ENVIRONMENTS; FORMAL MODEL; FORMAL VERIFICATIONS; ISABELLE; MECHANICAL VERIFICATION; MESSAGE LOSS; NETWORK COMMUNICATIONS; PROOF ASSISTANT; SAFETY PROPERTY; USER DATAGRAM PROTOCOL;

SEMANTICS; THEOREM PROVING;

TRANSMISSION CONTROL PROTOCOL;

EID: 67649859917     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Arts, T. & Dam, M. (1999), Verifying a distributed database lookup manager written in Erlang, in 'FM'99-Formal Methods, Volume I', Vol. 1708 of Lecture Notes in Computer Science, Springer, pp. 682-700.
2. Bhargavan, K., Obradovic, D. & Gunter, C. A. (2002), 'Formal verification of standards for dis- tance vector routing protocols', Journal of the ACM (JACM) 49(4), 538-576.
3. Charpentier, M. & Chandy, K. M. (2004), 'Speci- fication transformers: A predicate transformer approach to composition', Acta Informatica 40(3), 265-301.
4. Chkliaev, D., Hooman, J. & Vink, E. d. (2003), Ver- ification and improvement of the sliding window protocol, in H. Garavel & J. Hatcliff, eds, 'Proc. TACAS 2003', LNCS, p. 15pp.
5. Dam, M., Fredlund, L. & Gurov, D. (1998), 'Toward parametric verification of open distributed sys- tems', In Compositionality: the Significant Difference, H. Langmaack, A. Pnueli and W.-P. de Roever (eds.), Springer 1536, 150-185
6. de Roever, W.-P., de Boer, F., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M. & Zwiers, J. (2001), Concurrency Verification: Introduction to Compositional and Noncompositional Meth- ods, number 54 in 'Cambridge Tracts in Theo- retical Computer Science', Cambridge University Press, Cambridge, UK.
7. DiVito, B. (1982), Verification of the stenning pro- tocol, Technical report, University of Texas at Austin.
8. Gordon, M. J. C. & Melham, T. F. (1993), Introduc- tion to HOL (A theorem-proving environment for higher order logic), Cambridge University Press. Gordon, M., Milner, R. & Wadsworth, C. (1979), Ed- inburgh LCF, Vol. 78 of Lecture Notes in Com- puter Science, Springer.
9. Halpern, J. Y. & Zuck, L. D. (1992), 'A little knowl- edge goes a long way: Knowledge-Based deriva- tions and correctness proofs for a family of pro- tocols', Journal of the ACM 39(3), 449-478.
10. Lynch, N. A. (1996), Distributed Algorithms, Morgan Kaufmann Publishers.
11. Milner, R. (1999), Communicating and Mobile Sys- tems: the Pi-Calculus, Cambridge University Press.
12. Misra, J., Chandy, K. M. & Smith, T. (1982), Proving safety and liveness of communicating processes with examples, in 'Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing', ACM Press, pp. 201- 208.
13. Nipkow, T., Paulson, L. C. & Wenzel, M. (2002), Isabelle/HOL - A Proof Assistant for Higher- Order Logic, Vol. 2283 of LNCS, Springer.
14. Nipkow, T., Paulson, L. & Wenzel, M. (2003), Isabelle's logics: HOL. http: //isabelle.in.tum.de/dist/Isabelle2003/ doc/logics-HOL.pdf.
15. Postel, J. (1980), 'User Datagram Protocol, STD 6, RFC 768', Internet Engineering Task Force. http://www.ietf.org/rfc.html.
16. Postel, J. (1981), 'Internet Protocol, STD 5, RFC 791', Internet Engineering Task Force. http://www.ietf.org/rfc.html.
17. Schumann, J. (1995), Using the theorem prover SETHEO for verifying the development of a communication protocol in FOCUS: A case study, in 'Analytic Tableaux and Related Meth- ods', pp. 338-352. URL: citeseer.ist.psu.edu/schumann95using.html
18. Serjantov, A., Sewell, P. & Wansbrough, K. (2001a), The UDP calculus: Rigorous semantics for real networking, in 'Proceedings of TACS 2001: The- oretical Aspects of Computer Software (Sendai), LNCS 2215', pp. 535-559.
19. Serjantov, A., Sewell, P. & Wansbrough, K. (2001b), The UDP calculus: Rigorous semantics for real networking, Technical Report 515, Computer Laboratory, University of Cambridge. http: //www.cl.cam.ac.uk/users/pes20/Netsem/.
20. Simons, D. P. L. & Stoelinga, M. (2001), 'Mechan- ical verification of the IEEE 1394a root con- tention protocol using uppaal2k', International Journal on Software Tools for Technology Trans- fer 3(4), 469-485.
21. Stevens, W. R. (1998), UNIX Network Programming Vol. 1: Networking APIs: Sockets and XTI, sec- ond edn, Prentice Hall.
22. Stoelinga, M. & Vaandrager, F. (1999), 'Root con- tention in IEEE 1394', Lecture Notes in Com- puter Science 1601, 53-74.
23. Wansbrough, K., Norrish, M., Sewell, P. & Serjantov, A. (2002), Timing UDP: Mechanized semantics for sockets, threads, and failures, in 'Proceed- ings of ESOP 2002: the 11th European Sympo- sium on Programming (Grenoble), LNCS 2305', pp. 278-294.
24. Xavier Leroy et al (2004), The Objective-Caml Sys- tem, Release 3.08, INRIA. http://caml.inria. fr/ocaml/.