{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:55Z","timestamp":1761611215950},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427360"},{"type":"electronic","value":"9783540455004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45500-0_27","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T15:37:33Z","timestamp":1193326653000},"page":"535-559","source":"Crossref","is-referenced-by-count":8,"title":["The UDP Calculus: Rigorous Semantics for Real Networking"],"prefix":"10.1007","author":[{"given":"Andrei","family":"Serjantov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Sewell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keith","family":"Wansbrough","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,10]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"T. Arts and M. Dam. Verifying a distributed database lookup manager written in Erlang. In World Congress on Formal Methods (1), pages 682\u2013700, 1999.","DOI":"10.1007\/3-540-48119-2_38"},{"key":"27_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"R. Amadio","year":"1994","unstructured":"R. Amadio and S. Prasad. Localities and failures. In Foundations of Software Technology and Theoretical Computer Science, LNCS 880. Springer, 1994."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"F. Baker. Requirements for IP version 4 routers. Internet Engineering Task Force, June 1995. http:\/\/www.ietf.org\/rfc.html .","DOI":"10.17487\/rfc1812"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/360204.360221"},{"key":"27_CR5","unstructured":"M. Berger and K. Honda. The two-phase commit protocol in an extended \u2014 calculus. In Proceedings of the 7th International Workshop on Expressiveness in Concurrency, EXPRESS\u2019 00, 2000."},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"E. Biagioni. A structured TCP in standard ML. In Proc. SIGCOMM, 1994.","DOI":"10.1145\/190314.190318"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"R. Braden. Requirements for internet hosts-communication layers, STD 3, RFC 1122. IETF, October 1989. http:\/\/www.ietf.org\/rfc.html .","DOI":"10.17487\/rfc1122"},{"key":"27_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CONCUR\u2019 96","author":"C. Fournet","year":"1996","unstructured":"C. Fournet, G. Gonthier, J.-J. L-evy, L. Maranget, and D. R-emy. A calculus of mobile agents. In Proc. CONCUR\u2019 96, LNCS 1119. Springer, August 1996."},{"key":"27_CR9","unstructured":"S. J. Garland, N. Lynch, and M. Vaziri. IOA reference guide, December 2000. http:\/\/nms.lcs.mit.edu\/~garland\/IOA\/ ."},{"key":"27_CR10","unstructured":"M. Hayden. The Ensemble System. PhD thesis, Cornell University, January 1998. Technical Report TR98-1662."},{"key":"27_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BFb0057019","volume-title":"Proceedings of ECOOP\u2019 91","author":"K. Honda","year":"1991","unstructured":"K. Honda and M. Tokoro. An object calculus for asynchronous communication. In Proceedings of ECOOP\u2019 91, LNCS 512, pages 133\u2013147, July 1991."},{"key":"27_CR12","unstructured":"IEEE. Information Technology-Portable Operating System Interface (POSIX)-Part xx: Protocol Independent Interfaces (PII), P1003.1g. 2000."},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"INMOS. Occam2 Reference Manual. Prentice-Hall, 1987.","DOI":"10.1049\/esn.1987.0025"},{"key":"27_CR14","unstructured":"X. Leroy et al. The Objective-Caml System, Release 3.00. INRIA, April 27 2000. http:\/\/caml.inria.fr\/ocaml\/ ."},{"issue":"3","key":"27_CR15","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"L. Lamport","year":"1994","unstructured":"L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872\u2013923, May 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"27_CR16","unstructured":"_ N. A. Lynch. Distributed algorithms. Morgan Kaufmann, 1996."},{"issue":"1","key":"27_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Parts I + II. Information and Computation, 100(1):1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"27_CR18","unstructured":"S. J. Mullender. Distributed Systems. ACM Press, 1993."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"J. Postel. User Datagram Protocol, STD 6, RFC 768. Internet Engineering Task Force, August 1980. http:\/\/www.ietf.org\/rfc.html .","DOI":"10.17487\/rfc0768"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"J. Postel. Internet Protocol, STD 6, RFC 791. Internet Engineering Task Force, September 1981. http:\/\/www.ietf.org\/rfc.html .","DOI":"10.17487\/rfc0791"},{"key":"27_CR21","unstructured":"B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. In Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 2000."},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"J. Reppy. CML: A higher-order concurrent language. In Proc. Programming Language Design and Implementation (PLDI), pages 293\u2013259, June 1991.","DOI":"10.1145\/113446.113470"},{"key":"27_CR23","series-title":"Lect Notes Comput Sci","volume-title":"Automata, Languages and Programming","author":"J. Riely","year":"1997","unstructured":"J. Riely and M. Hennessy. Distributed processes and location failures. In Automata, Languages and Programming, LNCS 1256. Springer, 1997."},{"key":"27_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/3-540-63141-0_27","volume-title":"Proceedings of CONCUR\u2019 97","author":"P. Sewell","year":"1997","unstructured":"P. Sewell. On implementations and semantics of a concurrent programming language. In Proceedings of CONCUR\u2019 97, LNCS 1243, pages 391\u2013405, 1997."},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"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 .","DOI":"10.1007\/3-540-45500-0_27"},{"key":"27_CR26","unstructured":"W. R. Stevens. TCP\/IP Illustrated: The Protocols, volume 1 of Addison-Wesley Professional Computing Series. Addison-Wesley, 1994."},{"key":"27_CR27","unstructured":"W. R. Stevens. UNIX Network Programming, Networking APIs: Sockets and XTI, volume 1. Prentice Hall, second edition, 1998."},{"key":"27_CR28","unstructured":"The SwitchWare project. http:\/\/www.cis.upenn.edu\/~switchware , 2001."},{"key":"27_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-61604-7_61","volume-title":"Proceedings of CONCUR\u2019 96","author":"B. Thomsen","year":"1996","unstructured":"B. Thomsen, L. Leth, and T.-M. Kuo. A Facile tutorial. In Proceedings of CONCUR\u2019 96, LNCS 1119, pages 278\u2013298. Springer-Verlag, August 1996."},{"issue":"2","key":"27_CR30","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/4434.846193","volume":"8","author":"P. T. Wojciechowski","year":"2000","unstructured":"P. T. Wojciechowski and P. Sewell. Nomadic Pict: Language and infrastructure design for mobile agents. IEEE Concurrency, 8(2):42\u201352, April-June 2000.","journal-title":"IEEE Concurrency"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45500-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T20:54:48Z","timestamp":1556916888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45500-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427360","9783540455004"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45500-0_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}