The UDP calculus: Rigorous semantics for real networking

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

Volumn 2215, Issue , 2001, Pages 535-559

  Serjantov, Andrei ^a   Sewell, Peter ^a   Wansbrough, Keith ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; SEMANTIC WEB; SEMANTICS;

DISTRIBUTED PROGRAM; LANGUAGE BINDINGS; NETWORK PROGRAMMING; OPERATIONAL MODEL; OPERATIONAL SEMANTICS; PROCESS CALCULI; SMALL NETWORKS; SOCKET PROGRAMMING;

INTERNET PROTOCOLS;

EID: 84978976755     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45500-0_27     Document Type: Conference Paper

References (31)

1. [AD99] T. Arts and M. Dam. Verifying a distributed database lookup manager written in Erlang. In World Congress on Formal Met, hods (1)., pages 682-700, 1999.
2. [AP94] R. Amadio and S. Prasad. Localities and failures. In Foundations of Software Technology and Theoretical Computer Science, LNCS 880. Springer, 1994.
3. [Bak95] F. Baker. Requirements for IP version 4 routers. Internet Engineering Task Force, June 1995. http://www. ietf. org/rfc. html.
4. [BCMG01] K. Bhargavan, S. Chandra, P. J. McCann, and C. A. Gunter. What packets may come: Automata for network monitoring. In Proc. POPL 2001, January 2001.
5. [BH00] M. Berger and K. Honda. The two-phase commit protocol in an extended π-calculus. In Proceedings of the 7th International Workshop on Expressiveness in Concurrency, EXPRESS '00, 2000.
6. [Bia94] E. Biagioni. A structured TCP in standard ML. In Proc. SIGCOMM, 1994.
7. [Bra89] R. Braden. Requirements for internet hosts-communication layers, STD 3, RFC 1122. IETF, October 1989. http://www. ietf. org/rfc. html.
8. [CSR83] University of California at Berkeley CSRG. 4. 2BSD, 1983.
9. [FGL+96] C. Fournet, G. Gonthier, J.-J. Levy, L. Maranget, and D. Rémy. A calculus of mobile agents. In Proc. CONCUR '96, LNCS 1119. Springer, August 1996.
10. [GĽV00] S. J. Garland, N. Lynch, and M. Vaziri. IOA reference guide, December 2000. http://nms. lcs. rnit. edu/-garland/I0A/.
11. [Hay98] M. Hayden. The Ensemble System,. PhD thesis, Cornell University, January 1998. Technical Report TR98-1662.
12. [HT91] K. Honda and M. Tokoro. An object calculus for asynchronous communication. In Proceedings of ECOOP '91, LNCS 512, pages 133-147, July 1991.
13. [IEE00] IEEE. Information Technology-Portable Operating System, Interface (POSIX)-Part, xx: Protocol Independent Interfaces (PII), PlOOS. tg. 2000.
14. [INM87] INMOS. Occam2 Reference Manual. Prentice-Hall, 1987.
15. [L+00] X. Leroy et al. The Objective-Caml System, Release 3. 00. INRIA, April 27 2000. http://caml. inria. fr/ocaml/.
16. [Lam94] L. Lamport. The temporal logic of actions. ACM Transactions on, Programming Languages and Systems, 16(3): 872-923, May 1994.
17. [Lyn96] N. A. Lynch. Distributed algorithms. Morgan Kaufmann, 1996.
18. [MPW92] R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Parts I + II. Information and Computation, 100(l): 1-77, 1992.
19. [Mul93] S. J. Mullender. Distributed Systems. ACM Press, 1993.
20. [Pos80] J. Postel. User Datagram Protocol, STD 6, RFC 768. Internet Engineering Task Force, August 1980. http://www. ietf. org/rfc. html.
21. [Pos81] J. Postel. Internet Protocol, STD 6, RFC 791. Internet Engineering Task Force, September 1981. http://www. ietf. org/rfc. html.
22. [PT00] B. C. Pierce and D. N. Turner. Piet: A programming language based on the pi-calculus. In Proof, Language and Interaction: Essays in Honour of Robin, Milner. MIT Press, 2000.
23. [Rep91] J. Reppy. CML: A higher-order concurrent language. In Proc. Programming Language Design and Implementation (PLDI), pages 293-259, June 1991.
24. [RH97] J. Riely and M. Hennessy. Distributed processes and location failures. In Automata, Languages and Programming, LNCS 1256. Springer, 1997.
25. [Sew97] P. Sewell. On implementations and semantics of a concurrent programming language. In Proceedings of CONCUR '97, LNCS 1243, pages 391-405, 1997.
26. [SSW01] A. Serjantov, P. Sewell, and K. Wansbrough. The UDP calculus: Rigorous semantics for real networking. Technical Report 515, Computer Laboratory, University of Cambridge, 2001. http://www. cl. cam. ac. uk/users/pes20/Netsem.
27. [Ste94] W. R. Stevens. TCP/IP Illustrated: The Protocols, volume 1 of Addison Wesley Professional Computing Series. Addison-Wesley, 1994.
28. [Ste98] W. R. Stevens. UNIX Network, Programming, Networking APIs: Sockets and XTI, volume 1. Prentice Hall, second edition, 1998.
29. [SwiOl] The SwitchWare project, http://www. cis. upenn. edu/-switchware, 2001.
30. [TLK96] B. Thomsen, L. Leth, and T.-M. Kuo. A Facile tutorial. In Proceedings of CONCUR '96, LNCS 1119, pages 278-298. Springer-Verlag, August 1996.
31. [WSOO] P. T. Wojciechowski and P. Sewell. Nomadic Piet: Language and infrastructure design for mobile agents. IEEE Concurrency, 8(2): 42-52, April-June 2000.