NetKAT -- a formal system for the verification of networks. This paper presents a survey of recent work in the development of NetKAT, a formal system for reasoning about packet switching networks, and its role in the emerging area of software-defined networking.

References in zbMATH (referenced in 11 articles , 2 standard articles )

Showing results 1 to 11 of 11.
Sorted by year (citations)

  1. Mamouras, Konstantinos: Equational theories of abnormal termination based on Kleene algebra (2017)
  2. Foster, Nate; Kozen, Dexter; Mamouras, Konstantinos; Reitblatt, Mark; Silva, Alexandra: Probabilistic NetKAT (2016)
  3. Mamouras, Konstantinos: The Hoare logic of deterministic and nondeterministic monadic recursion schemes (2016)
  4. Thiemann, Peter (ed.): Programming languages and systems. 25th European symposium on programming, ESOP 2016, held as part of the European joint conferences on theory and practice of software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016. Proceedings (2016)
  5. Uramoto, Takeo: Canonical finite models of Kleene algebra with tests (2016)
  6. Smolka, Steffen; Eliopoulos, Spiridon; Foster, Nate; Guha, Arjun: A fast compiler for NetKAT (2015)
  7. -: Proceedings of the 41st ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’14, San Diego, CA, USA, January 22--24, 2014 (2014)
  8. Anderson, Carolyn Jane; Foster, Nate; Guha, Arjun; Jeannin, Jean-Baptiste; Kozen, Dexter; Schlesinger, Cole; Walker, David: Netkat, semantic foundations for networks (2014)
  9. Garrigue, Jacques (ed.): Programming languages and systems. 12th Asian symposium, APLAS 2014, Singapore, Singapore, November 17--19, 2014, Proceedings (2014)
  10. Höfner, Peter; McIver, Annabelle: Hopscotch -- reaching the target hop by hop (2014)
  11. Kozen, Dexter: NetKAT -- a formal system for the verification of networks (2014)