COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > KAT on a Wire: A Foundation for Network Programming
KAT on a Wire: A Foundation for Network ProgrammingAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins. This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending Recent years have seen growing interest in high-level programming languages for 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 language for programming networks 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; operators for combining programs in parallel and in sequence; and a Kleene star operator. 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 properties, proving the correctness of compilation and optimization algorithms, and establishing a non-interference property that ensures isolation between programs. This talk is part of the Microsoft Research Cambridge, public talks series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsMicrosoft Research Computational Science Seminars Clinical Neuroscience and Mental Health Symposium Institute of Astronomy Seminars Type the title of a new list here ASNC Research SeminarOther talksDirect measurements of dynamic granular compaction at the mesoscale using synchrotron X-ray radiography Finding the past: Medieval Coin Finds at the Fitzwilliam Museum The Most Influential Living Philosopher? Cambridge - Corporate Finance Theory Symposium September 2018 - Day 1 The Mid-Twentieth Century Babyboom and the Role of Social Interaction. An Agent-Based Modelling Approach Towards bulk extension of near-horizon geometries The Gopakumar-Vafa conjecture for symplectic manifolds 'The Japanese Mingei Movement and the art of Katazome' A rose by any other name Knot Floer homology and algebraic methods The Exposome in Epidemiological Practice |