Probabilistic programming languages (PPLs) are an expressive means of representing and
reasoning about probabilistic models. The computational challenge of probabilistic …

We present Lilac, a separation logic for reasoning about probabilistic programs where
separating conjunction captures probabilistic independence. Inspired by an analogy with …

Increasing demand on computer networks continuously pushes manufacturers to
incorporate novel features and capabilities into their switches at an ever-accelerating pace …

Recently, there is a flurry of projects that develop data plane systems in programmable
switches, and these systems perform far more sophisticated processing than simply deciding …

Network misconfiguration has caused a raft of high-profile outages over the past decade,
spurring researchers to develop a variety of network analysis and verification tools …

Accurate and thorough analysis of network performance is challenging. Network simulations
and emulations can only cover a subset of the continuously evolving set of workloads …

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 …

BGP is the de-facto Internet routing protocol for exchanging prefix reachability information
between Autonomous Systems (AS). It is a dynamic, distributed, path-vector protocol that …

We propose trace abstraction modulo probability, a proof technique for verifying high-
probability accuracy guarantees of probabilistic programs. Our proofs overapproximate the …

ProbNV is a new framework for probabilistic network control plane verification that strikes a
balance between generality and scalability. ProbNV is general enough to encode a wide …