Melange: Creating a "functional" internet

Operating Systems Review (ACM)

Volumn , Issue , 2007, Pages 101-114

  Madhavapeddy, Anil ^a,b   Ho, Alex ^a,c   Deegan, Tim ^a,b   Scott, David ^b   Sohan, Ripduman ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b XenSource Inc

^c Arastra Inc

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); DYNAMIC PROGRAMMING; METADATA; OBJECT ORIENTED PROGRAMMING; RELIABILITY THEORY; SECURITY OF DATA; INTERNET; LINGUISTICS; NETWORK PROTOCOLS; NETWORK SECURITY; PROBLEM ORIENTED LANGUAGES; QUERY LANGUAGES; REFUSE COLLECTION; SERVERS; TRANSMISSION CONTROL PROTOCOL; WASTE DISPOSAL;

META-PROGRAMMING; TYPE-SAFE LANGUAGES;

INTERNET PROTOCOLS;

AUTOMATIC GARBAGE COLLECTION; COMPILE TIME; COMPLEX APPLICATIONS; DNS SERVER; DOMAIN SPECIFIC LANGUAGES; INTERNET PACKETS; META PROGRAMMING; OPTIMISATIONS; PERFORMANCE PENALTIES; QUANTITATIVE ANALYSIS; RELIABILITY PROBLEMS; RUN-TIME TYPES; SOURCE CODES; STATIC TYPING; TYPE-SAFE LANGUAGES; ZERO-COPY;

EID: 34548011724     PISSN: 01635980     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1272996.1273009     Document Type: Conference Paper

References (48)

1. ALBITZ, P., AND LIU, C. DNS and BIND, fourth ed. O'Reilly, 2001.
2. BARHAM, P., DRAGOVIC, B., FRASER, K., HAND, S., HARRIS, T., HO, A., NEUGEBAUER, R., PRATT, I., AND WARFIELD, A. Xen and the art of virtualization. In Proc. of 19th SOSP (Bolton Landing, NY, 2003), pp. 164-177.
3. BERNSTEIN, D. J. DNS server survey [online]. 2002. http://cr.yp.to/surveys/dns1.html.
4. BIAGIONI, E. A structured TCP in Standard ML. In Proc. of SIGCOMM (London, UK, 1994), pp. 36-45.
5. BIAGIONI, E., HARPER, R., AND LEE, P. A network protocol stack in Standard ML. Higher Order Symbolic Computing 14, 4 (2001), 309-356.
6. BILLINGS, J., FRASER, A., AND SCOTT, D. Orion: Named flows with access control. Tech. rep., Fraser Research, Princeton, NJ, USA, 2005.
7. BILLINGS, J., SEWELL, P., SHINWELL, M., AND STRNISA, R. Type-safe distributed programming for OCaml. In Proceedings of the 2006 ACM-SIGPLAN Workshop on ML (2006).
8. BOS, H., DE BRUIJN, W., CRISTEA, M., NGUYEN, T., AND PORTOKALIDIS, G. FFPF: Fairly Fast Packet Filters. In Proc. of 6th Symp. on OSDI (2004), pp. 347-363.
9. BREWER, E., CONDIT, J., MCCLOSKEY, B., AND ZHOU, F. Thirty years is long enough: Getting beyond C. In Proc. of 10th HotOS Workshop (2005).
10. CHU, H. K. J. Zero-copy TCP in Solaris. In Proceedings of the USENDC Annual Technical Conference (1996), USENIX, pp. 253-264.
11. COOK, B., PODELSKI, A., AND RYBALCHENKO, A. Termination proofs for systems code. In Proc. of PLDI (2006).
12. DEEGAN, T., CROWCROFT, J., AND WARFIELD, A. The main name system: an exercise in centralized computing. Computer Communications Review 35, 5 (2005), 5-14.
13. DEEGAN, T. J. The Main Name System. PhD thesis, University of Cambridge, 2006.
14. DOLIGEZ, D., AND LEROY, X. A concurrent, generational garbage collector for a multithreaded implementation of ML. In Proc. of the 20th Symp. on PoPL (Charleston, South Carolina, 1993), pp. 113-123.
15. DRUSCHEL, P., AND PETERSON, L. L. Fbufs: a high-bandwidth cross-domain transfer facility. In Proc. of 14th SOSP (1993), pp. 189-202.
16. ENNALS, R., SHARP, R., AND MYCROFT, A. Linear types for packet processing. In 13th European Symp. on Programming (Barcelona, Spain, 2004), pp. 204-218.
17. FISHER, K., AND GRUBER, R. PADS: a domain-specific language for processing ad hoc data. In Proc. of 2005 Conf on PLDI (Chicago, IL, 2005), pp. 295-304.
18. FOSTER, J. N., GREENWALD, M. B., MOORE, J. T., PIERCE, B. C., AND SCHMITT, A. Combinators for bi-directional tree transformations: a linguistic approach to the view update problem. In Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (New York, NY, USA, 2005), ACM Press, pp. 233-246.
19. GARRIGUE, J. Programming with polymorphic variants. In SIGPLAN Workshop on ML (Baltimore, MD, 1998).
20. GRIFFIN, T. G., AND SOBRINHO, J. L. Metarouting. In Proc. of SIGCOMM (Philadelphia, PA, 2005), pp. 1-12.
21. GUNAWI, H. S., ARPACI-DUSSEAU, A. C., AND ARPACI-DUSSEAU, R. H. Deploying safe user-level network services with icTCP. In Proc. of 6th Symp. on OSDI (2004), pp. 317-332.
22. HAYDEN, M. The Ensemble System. TR98-1662, Cornell University, 1998.
23. HENSBERGEN, E. V. Plan 9 remote resource protocol (experimental-draft-9p2000-protocol), March 2005. http://v9fs.sourceforge.net/ rfc/.
24. JACOBSON, V., LERES, C., AND MCCANNE, S. Packet capture with tcpdump and pcap [online]. http://www.tcpdump.org/.
25. JIM, T., MORRISETT, G., GROSSMAN, D., HICKS, M., CHENEY, J., AND WANG, Y. Cyclone: A safe dialect of C. In Proceedings of USENIX Annual Tech. Conf (General Track) (2002), pp. 275-288.
26. JUNG, J., SIT, E., BALAKRISHNAN, H., AND MORRIS, R. DNS performance and the effectiveness of caching. In Proc. of 1st Workshop on Internet Measurement (San Francisco, CA, 2001), pp. 153-167.
27. KOHLER, E., KAASHOEK, M. F., AND MONTGOMERY, D. R. A readable TCP in the Prolac protocol language. In Proc. of SIGCOMM (Cambridge, MA, 1999), pp. 3-13.
28. KOHLER, E., MORRIS, R., CHEN, B., JANNOTTI, J., AND KAASHOEK, M. F. The Click modular router. ACM Trans. on Computer Systems 18, 3 (2000), 263-297.
29. LEROY, X., DOLIGEZ, D., GARRIGUE, J., RÉMY, D., AND VOUILLON, J. The Objective Caml system [online]. 2005. http://caml.inria.fr/.
30. LETOUZEY, P. Exécution de termes de preuves: une nouvelle méthode d'extraction pour le Calcul des Constructions Inductives. Université Paris VI, 2000.
31. LOO, B. T., CONDIE, T., HELLERSTEIN, J. M., MANIATIS, P., ROSCOE, T., AND STOICA, I. Implementing declarative overlays. In Proc. of 20th SOSP (2005), pp. 75-90.
32. MADHAVAPEDDY, A. Creating High-Performance Statically Type-Safe Network Applications. PhD thesis, University of Cambridge, 2006.
33. MADHAVAPEDDY, A., AND SCOTT, D. On the challenge of delivering high-performance, dependable, model-checked internet servers. In First Workshop on Hot Topics in System Dependability (2005).
34. MADHAVAPEDDY, A., SCOTT, D., AND SHARP, R. SPLAT: A tool for model-checking and dynamically enforcing abstractions. In 12th Int'l SPIN Workshop on Model Checking of Software (2005), pp. 277-281.
35. MCCANN, P. J., AND CHANDRA, S. Packet types: Abstract specification of network protocol messages. In Proc. of SIGCOMM (2000), pp. 321-333.
36. MCCANNE, S., AND JACOBSON, V. The BSD packet filter: A new architecture for user-level packet capture. In Proceedings of the USENIX Winter Technical Conference (1993), pp. 259-270.
37. MCKUSICK, M. K., AND NEVILLE-NEIL, G. V. The Design and Implementation of the FreeBSD Operating System. Addison-Wesley Professional Computing Series, August 2004.
38. MOORE, D. DNS server survey [online]. 2004. mydns.bboy.net/ survey/.
39. MOSBERGER, D., AND PETERSON, L. L. Making paths explicit in the Scout operating system. In Proceedings of the 2nd USENIX Symposium on Operating Systems Design and Implementation (1996), pp. 153-167.
40. NECULA, G. C., MCPEAK, S., AND WEIMER, W. CCured: Type-safe retrofitting of legacy code. In Proc. of 29th Symp. on POPL (Portland, OR, 2002), pp. 128-139.
41. O'MALLEY, S., PROEBSTING, T., ANDM ONTZ, A. B. Usc: a universal stub compiler. In Proceedings of the Conference on Communications Architectures, Protocols and Applications (New York, NY, USA, 1994), ACM Press, pp. 295-306.
42. PANG, R., PAXSON, V., SOMMER, R., AND PETERSON, L. binpac: A yace for writing application protocol parsers. In Proceedings of the Internet Measurement Conference (2006).
43. PFLEEGER, S. L., AND HATTON, L. Investigating the influence of formal methods. Computer 30, 2 (1997), 33-43.
44. PIKE, R., PRESOTTO, D., THOMPSON, K., TRICKEY, H., AND WINTERBOTTOM, P. The use of name spaces in Plan 9. Operating Systems Review 27, 2 (1993), 72-76.
45. PROVOS, N., FRIEDL, M., AND HONEYMAN, P. Preventing privilege escalation. In Proc. of 12th USENIX Security Symposium (2003), pp. 231-242.
46. PROVOS, N., AND HONEYMAN, P. ScanSSH: Scanning the internet for SSH servers. In Proc. of 15th LISA (San Diego, CA, 2001), pp. 25-30.
47. RÉMY, D., AND VOUILLON, J. Objective ML: a simple object-oriented extension of ML. In Proc. of 24th Symp. on POPL (1997), pp. 40-53.
48. XI, H., AND PFENNING, F. Eliminating array bound checking through dependent types. In Proc. of Conf. on PLDI (1998), pp. 249-257.