39 citations · 146 across the 23 of their papers we have counts for
6 papers · 1 filter
StacKAT: Infinite State Network Verification
Jules Jacobs, Nate Foster, Tobias Kappé +4
We develop StacKAT, a network verification language featuring loops, finite state variables, nondeterminism, and - most importantly - access to a stack with accompanying push and p…
Joint Distributions in Probabilistic Semantics
Dexter Kozen, Alexandra Silva, Erik Voogd
Various categories have been proposed as targets for the denotational semantics of higher-order probabilistic programming languages. One such proposal involves joint probability di…
Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks
Jana Wagemaker, Nate Foster, Tobias Kappé +3
We introduce Concurrent NetKAT (CNetKAT), an extension of NetKAT with operators for specifying and reasoning about concurrency in scenarios where multiple packets interact through…
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…