Weighted NetKAT: A Programming Language For Quantitative Network Verification
Abstract
We introduce weighted NetKAT, a domain-specific language for modeling and verifying quantitative network properties. The language is parametric on a semiring, enabling the treatment of a wide range of quantities in a uniform way. We provide a denotational semantics and an equivalent operational semantics, the latter based on a novel model of weighted NetKAT automata (WNKA) capturing the stateful behavior of our language. With WNKA, we obtain a class of generic decision procedures for reasoning about quantitative safety and reachability in a fully automatic way, even in the presence of possibly unbounded iteration. We demonstrate the applicability of our framework in a case study using Internet2's Abilene network as the underlying topology.
Cite
@article{arxiv.2604.13987,
title = {Weighted NetKAT: A Programming Language For Quantitative Network Verification},
author = {Emmanuel Suárez Acevedo and Tiago Ferreira and Kevin Batz and Oliver Bøving and Nate Foster and Alexandra Silva},
journal= {arXiv preprint arXiv:2604.13987},
year = {2026}
}
Comments
Appearing in PLDI 2026