arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.04760cs.PL
收藏

KATch:一个面向 NetKAT 的快速符号验证器

KATch: A Fast Symbolic Verifier for NetKAT

Mark Moeller, Jules Jacobs, Olivier Savary Belanger, David Darais, Cole Schlesinger, Steffen Smolka, Nate Foster, Alexandra Silva

AI总结:

本文提出基于符号自动机扩展技术的 NetKAT 快速验证器 KATch,通过新数据结构和算法实现高效验证,在真实与合成基准上验证可达性和切片隔离等属性,速度比以往方法快数个数量级。

摘要:

我们开发了新的数据结构和算法,用于检查 NetKAT 中的验证查询。NetKAT 是一种用于描述网络数据平面行为的领域特定语言。我们的结果扩展了先前在符号自动机方面的工作中所获得的技术,并提供了一个用于构建高效且可扩展验证工具的框架。我们提出了 KATch,这是这些思想在 Scala 中的实现,具有一组扩展的 NetKAT 算子,这些算子对于表达网络范围的规范很有用,以及一个验证引擎,该引擎构造一个互模拟或生成一个反例以表明不存在互模拟。我们在真实世界和合成基准上评估了我们实现的性能,验证了可达性和切片隔离等属性,通常在远低于一秒的时间内返回结果,这比先前的方法快了几个数量级。我们的进展凸显了 NetKAT 作为一种实用的、声明式的网络规范与验证语言的潜力。

英文摘要:

We develop new data structures and algorithms for checking verification queries in NetKAT, a domain-specific language for specifying the behavior of network data planes. Our results extend the techniques obtained in prior work on symbolic automata and provide a framework for building efficient and scalable verification tools. We present KATch, an implementation of these ideas in Scala, featuring an extended set of NetKAT operators that are useful for expressing network-wide specifications, and a verification engine that constructs a bisimulation or generates a counter-example showing that none exists. We evaluate the performance of our implementation on real-world and synthetic benchmarks, verifying properties such as reachability and slice isolation, typically returning a result in well under a second, which is orders of magnitude faster than previous approaches. Our advancements underscore NetKAT's potential as a practical, declarative language for network specification and verification.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑