To refer to this page use:
|Abstract:||Recent years have seen growing interest in high-level languages for programming networks. But the design of these languages has been largely ad hoc, driven more by the needs of applications and the capabilities of network hardware than by foundational principles. The lack of a semantic foundation has left language designers with little guidance in determining how to incorporate new features, and programmers without a means to reason precisely about their code. This paper presents NetKAT, a new network programming language that is based on a solid mathematical foundation and comes equipped with a sound and complete equational theory. We describe the design of NetKAT, including primitives for filtering, modifying, and transmitting packets; union and sequential composition operators; and a Kleene star operator that iterates programs. We show that NetKAT is an instance of a canonical and well-studied mathematical structure called a Kleene algebra with tests (KAT) and prove that its equational theory is sound and complete with respect to its denotational semantics. Finally, we present practical applications of the equational theory including syntactic techniques for checking reachability, proving non-interference properties that ensure isolation between programs, and establishing the correctness of compilation algorithms.|
|Citation:||Anderson, Carolyn Jane, Nate Foster, Arjun Guha, Jean-Baptiste Jeannin, Dexter Kozen, Cole Schlesinger, and David Walker. "NetKAT: semantic foundations for networks." Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 49, no. 1 (2014): 113-126. doi:10.1145/2535838.2535862|
|Pages:||113 - 126|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.