Weighted NetKAT: A Programming Language For Quantitative Network Verification
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917410747973632 |
|---|---|
| author | Acevedo, Emmanuel Suárez Ferreira, Tiago Batz, Kevin Bøving, Oliver Foster, Nate Silva, Alexandra |
| author_facet | Acevedo, Emmanuel Suárez Ferreira, Tiago Batz, Kevin Bøving, Oliver Foster, Nate Silva, Alexandra |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_13987 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Weighted NetKAT: A Programming Language For Quantitative Network Verification Acevedo, Emmanuel Suárez Ferreira, Tiago Batz, Kevin Bøving, Oliver Foster, Nate Silva, Alexandra Programming Languages 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. |
| title | Weighted NetKAT: A Programming Language For Quantitative Network Verification |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2604.13987 |