Active Learning of Symbolic NetKAT Automata
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_ | 1866910963886718976 |
|---|---|
| author | Moeller, Mark Ferreira, Tiago Lu, Thomas Foster, Nate Silva, Alexandra |
| author_facet | Moeller, Mark Ferreira, Tiago Lu, Thomas Foster, Nate Silva, Alexandra |
| contents | NetKAT is a domain-specific programming language and logic that has been successfully used to specify and verify the behavior of packet-switched networks. This paper develops techniques for automatically learning NetKAT models of unknown networks using active learning. Prior work has explored active learning for a wide range of automata (e.g., deterministic, register, Büchi, timed etc.) and also developed applications, such as validating implementations of network protocols. We present algorithms for learning different types of NetKAT automata, including symbolic automata proposed in recent work. We prove the soundness of these algorithms, build a prototype implementation, and evaluate it on a standard benchmark. Our results highlight the applicability of symbolic NetKAT learning for realistic network configurations and topologies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_13794 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Active Learning of Symbolic NetKAT Automata Moeller, Mark Ferreira, Tiago Lu, Thomas Foster, Nate Silva, Alexandra Programming Languages NetKAT is a domain-specific programming language and logic that has been successfully used to specify and verify the behavior of packet-switched networks. This paper develops techniques for automatically learning NetKAT models of unknown networks using active learning. Prior work has explored active learning for a wide range of automata (e.g., deterministic, register, Büchi, timed etc.) and also developed applications, such as validating implementations of network protocols. We present algorithms for learning different types of NetKAT automata, including symbolic automata proposed in recent work. We prove the soundness of these algorithms, build a prototype implementation, and evaluate it on a standard benchmark. Our results highlight the applicability of symbolic NetKAT learning for realistic network configurations and topologies. |
| title | Active Learning of Symbolic NetKAT Automata |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2504.13794 |