arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.06098cs.NIcs.FL
收藏

Kirigami:网络切割的可验证艺术

Kirigami, the Verifiable Art of Network Cutting

Tim Alberdingk Thijm, Ryan Beckett, Aarti Gupta, David Walker

AI总结:

提出模块化网络控制平面验证方法Kirigami,通过带注释的切割将网络分片独立验证,实现可靠完备的假设-保证推理,在工业拓扑上使端到端验证提速2-8倍,SMT求解最多快6个数量级。

摘要:

我们提出了一种用于网络控制平面验证的模块化验证方法,通过将网络切分为更小的片段来提升SMT求解的可扩展性。用户提供一个带注释的切割,描述如何从整体网络生成这些片段,我们独立验证每个片段,利用注释定义片段上的假设和保证,类似于假设-保证推理。我们证明该模块化网络验证过程相对于整体网络验证是可靠且完备的。我们将该过程实现为Kirigami,即NV(一种网络验证语言和工具)的扩展,并在带有合成策略的工业拓扑上进行了评估。我们观察到端到端NV验证时间提升了2-8倍,SMT求解时间最多提升了6个数量级。

英文摘要:

We introduce a modular verification approach to network control plane verification, where we cut a network into smaller fragments to improve the scalability of SMT solving. Users provide an annotated cut which describes how to generate these fragments from the monolithic network, and we verify each fragment independently, using the annotations to define assumptions and guarantees over fragments akin to assume-guarantee reasoning. We prove this modular network verification procedure is sound and complete with respect to verification over the monolithic network. We implement this procedure as Kirigami, an extension of NV - a network verification language and tool - and evaluate it on industrial topologies with synthesized policies. We observe a 2-8x improvement in end-to-end NV verification time, with SMT solve time improving by up to 6 orders of magnitude.

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

↑