NetkAT: Semantic foundations for networks

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2014, Pages 113-126

  Anderson, Carolyn Jane ^a   Foster, Nate ^b   Guha, Arjun ^c   Jeannin, Jean Baptiste ^d   Kozen, Dexter ^b   Schlesinger, Cole ^e   Walker, David ^e  

^a SWARTHMORE COLLEGE   (United States)

^b Department of Obstetrics Gynecology   (United States)

^c UNIVERSITY OF MASSACHUSETTS   (United States)

^d CARNEGIE MELLON UNIVERSITY   (United States)

^e PRINCETON UNIVERSITY   (United States)

Author keywords

domain specific languages; frenetic; kleene algebra with tests; netkat; network programming languages; software defined networking

Indexed keywords

DOMAIN SPECIFIC LANGUAGES; FRENETIC; KLEENE ALGEBRA WITH TESTS; NETKAT; NETWORK PROGRAMMING LANGUAGE; SOFTWARE-DEFINED NETWORKINGS;

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; DESIGN; PROBLEM ORIENTED LANGUAGES; SEMANTICS;

APPLICATION PROGRAMS;

EID: 84893444575     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2535838.2535862     Document Type: Conference Paper

References (34)

1. Ehab Al-Shaer and Saeed Al-Haj. FlowChecker: Configuration analysis and verification of federated OpenFlow infrastructures. In Safe-Config, 2010.
2. Allegra Angus and Dexter Kozen. Kleene algebra with tests and program schematology. Technical Report TR2001-1844, Computer Science Department, Cornell University, July 2001.
3. Ernie Cohen. Using Kleene algebra to reason about concurrency control. Technical report, Telcordia, Morristown, N.J., 1994.
4. John Horton Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.
5. Andrew D. Ferguson, Arjun Guha, Chen Liang, Rodrigo Fonseca, and Shriram Krishnamurthi. Participatory networking: An API for application control of SDNs. In SIGCOMM, 2013.
6. Nate Foster, Rob Harrison, Michael J. Freedman, Christopher Monsanto, Jennifer Rexford, Alec Story, and David Walker. Frenetic: A network programming language. In ICFP, September 2011.
7. Arjun Guha, Mark Reitblatt, and Nate Foster. Machine-verified network controllers. In PLDI, June 2013.
8. Stephen Gutz, Alec Story, Cole Schlesinger, and Nate Foster. Splendid isolation: A slice abstraction for software-defined networks. In HotSDN, 2012.
9. James Hamilton. Networking: The last bastion of mainframe computing, December 2009. Available at http://tinyurl.com/y9uz64e.
10. Peyman Kazemian, George Varghese, and Nick McKeown. Header space analysis: Static checking for networks. In NSDI, 2012.
11. Ahmed Khurshid, Xuan Zou, Wenxuan Zhou, Matthew Caesar, and P. Brighten Godfrey. VeriFlow: Verifying network-wide invariants in real time. In NSDI, 2013.
12. Dexter Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. I&C, 110(2):366-390, May 1994.
13. Dexter Kozen. Kleene algebra with tests and commutativity conditions. In TACAS, pages 14-33, Passau, Germany, March 1996.
14. Dexter Kozen. Kleene algebra with tests. Transactions on Programming Languages and Systems, 19(3):427-443, May 1997.
15. Dexter Kozen. Kleene algebras with tests and the static analysis of programs. Technical Report TR2003-1915, Computer Science Department, Cornell University, November 2003.
16. Dexter Kozen and Maria-Cristina Patron. Certification of compiler optimizations using Kleene algebra with tests. In CL, July 2000.
17. Dexter Kozen and Frederick Smith. Kleene algebra with tests: Completeness and decidability. In CSL, September 1996.
18. Boon Thau Loo, Joseph M. Hellerstein, Ion Stoica, and Raghu Ramakrishnan. Declarative routing: Extensible routing with declarative queries. In SIGCOMM, 2005.
19. Haohui Mai, Ahmed Khurshid, Raghit Agarwal, Matthew Caesar, P. Brighten Godfrey, and Samuel Talmadge King. Debugging the data plane with Anteater. In SIGCOMM, 2011.
20. James McCauley, Aurojit Panda, Martin Casado, Teemu Koponen, and Scott Shenker. Extending SDN to large-scale networks. In ONS, 2013.
21. Nick McKeown, Tom Anderson, Hari Balakrishnan, Guru Parulkar, Larry Peterson, Jennifer Rexford, Scott Shenker, and Jonathan Turner. OpenFlow: Enabling innovation in campus networks. SIGCOMM Computing Communications Review, 38(2):69-74, 2008.
22. B. Möller. Calculating with pointer structures. In Algorithmic Languages and Calculi. Proc. IFIP TC2/WG2.1 Working Conference, February 1997.
23. Christopher Monsanto, Nate Foster, Rob Harrison, and David Walker. A compiler and run-time system for network programming languages. In POPL, January 2012.
24. Christopher Monsanto, Joshua Reich, Nate Foster, Jennifer Rexford, and David Walker. Composing software-defined networks. In NSDI, April 2013.
25. Tim Nelson, Arjun Guha, Daniel J. Dougherty, Kathi Fisler, and Shriram Krishnamurthi. A balance of power: Expressive, analyzable controller programming. In HotSDN, 2013.
26. Mark Reitblatt, Nate Foster, Jennifer Rexford, Cole Schlesinger, and David Walker. Abstractions for network update. In SIGCOMM, 2012.
27. Andrei Sabelfeld and Andrew C. Myers. Language-based information-flow security. IEEE Journal on Selected Areas in Communications, 21(1):5-19, 2003.
28. Gunther Schmidt. Relational Mathematics. Cambridge University Press, 2010.
29. O. Shmueli. Decidability and expressiveness aspects of logic queries. In PODS, pages 237-249, 1987.
30. The Frenetic Project, 2013. See http://frenetic-lang.org.
31. Andreas Voellmy and Paul Hudak. Nettle: Functional reactive programming of OpenFlow networks. In PADL, 2011.
32. Andreas Voellmy, Junchang Wang, Y. Richard Yang, Bryan Ford, and Paul Hudak. Maple: Simplifying SDN programming using algorithmic policies. In SIGCOMM, 2013.
33. Anduo Wang, Limin Jia, Changbin Liu, Boon Thau Loo, Oleg Sokolsky, and Prithwish Basu. Formally veriable networking. In HotNets, 2009.
34. Minlan Yu, Jennifer Rexford, Xin Sun, Sanjay G. Rao, and Nick Feamster. A survey of virtual LAN usage in campus networks. IEEE Communications Magazine, 49(7):98-103, 2011.