44 citations · 148 across the 6 of their papers we have counts for
6 papers
KATch: A Fast Symbolic Verifier for NetKAT
Mark Moeller, Jules Jacobs, Olivier Savary Belanger +5
We develop new data structures and algorithms for checking verification queries in NetKAT, a domain-specific language for specifying the behavior of network data planes. Our result…
Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time
Steffen Smolka, Nate Foster, Justin Hsu +3
Guarded Kleene Algebra with Tests (GKAT) is a variation on Kleene Algebra with Tests (KAT) that arises by restricting the union () and iteration () operations from KAT to pre…
Scalable Verification of Probabilistic Networks
Steffen Smolka, Praveen Kumar, David M Kahn +4
This paper presents McNetKAT, a scalable tool for verifying probabilistic network programs. McNetKAT is based on a new semantics for the guarded and history-free fragment of Probab…
Probabilistic Program Equivalence for NetKAT
Steffen Smolka, Praveen Kumar, Nate Foster +4
We tackle the problem of deciding whether two probabilistic programs are equivalent in Probabilistic NetKAT, a formal language for specifying and reasoning about the behavior of pa…
Cantor meets Scott: Semantic Foundations for Probabilistic Networks
Steffen Smolka, Praveen Kumar, Nate Foster +2
ProbNetKAT is a probabilistic extension of NetKAT with a denotational semantics based on Markov kernels. The language is expressive enough to generate continuous distributions, whi…
A Fast Compiler for NetKAT
Steffen Smolka, Spiridon Eliopoulos, Nate Foster +1
High-level programming languages play a key role in a growing number of networking platforms, streamlining application development and enabling precise formal reasoning about netwo…