StacKAT: Infinite State Network Verification
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909650112217088 |
|---|---|
| author | Jacobs, Jules Foster, Nate Kappé, Tobias Kozen, Dexter Saada, Lily Silva, Alexandra Wagemaker, Jana |
| author_facet | Jacobs, Jules Foster, Nate Kappé, Tobias Kozen, Dexter Saada, Lily Silva, Alexandra Wagemaker, Jana |
| contents | We develop StacKAT, a network verification language featuring loops, finite state variables, nondeterminism, and - most importantly - access to a stack with accompanying push and pop operations. By viewing the variables and stack as the (parsed) headers and (to-be-parsed) contents of a network packet, StacKAT can express a wide range of network behaviors including parsing, source routing, and telemetry. These behaviors are difficult or impossible to model using existing languages like NetKAT. We develop a decision procedure for StacKAT program equivalence, based on finite automata. This decision procedure provides the theoretical basis for verifying network-wide properties and is able to provide counterexamples for inequivalent programs. Finally, we provide an axiomatization of StacKAT equivalence and establish its completeness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_13383 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | StacKAT: Infinite State Network Verification Jacobs, Jules Foster, Nate Kappé, Tobias Kozen, Dexter Saada, Lily Silva, Alexandra Wagemaker, Jana Programming Languages We develop StacKAT, a network verification language featuring loops, finite state variables, nondeterminism, and - most importantly - access to a stack with accompanying push and pop operations. By viewing the variables and stack as the (parsed) headers and (to-be-parsed) contents of a network packet, StacKAT can express a wide range of network behaviors including parsing, source routing, and telemetry. These behaviors are difficult or impossible to model using existing languages like NetKAT. We develop a decision procedure for StacKAT program equivalence, based on finite automata. This decision procedure provides the theoretical basis for verifying network-wide properties and is able to provide counterexamples for inequivalent programs. Finally, we provide an axiomatization of StacKAT equivalence and establish its completeness. |
| title | StacKAT: Infinite State Network Verification |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2506.13383 |