Specification and verification of computer networks has become a reality in recent years, with the emergence of domain-specific programming languages and automated reasoning tools. But the design of these frameworks has been largely ad hoc, driven more by the needs of applications and the capabilities of hardware than by any foundational principles. This talk will present NetKAT, a language for programming networks based on a well-studied mathematical foundation: regular languages and finite automata. The talk will describe the design of the language, its semantic underpinnings, and discuss ongoing work extending the language with stateful and probabilistic features.
-------------------------------------------------------------------------
To RSVP to this session, please log in to your Open Networking Summit registration
here.If you are not registered to Open Networking Summit (ONS), you can do so
here.If you have registered to SOSR already, no action is needed.
