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, discuss its semantic underpinnings, and present highlights from ongoing work extending the language with stateful and probabilistic features.
CITATION STYLE
Foster, N. (2017). The next 700 network programming languages. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. Part F128415, p. 7). Association for Computing Machinery. https://doi.org/10.1145/3055399.3081042
Mendeley helps you to discover research relevant for your work.