@article{thijm2022kirigami,
author = {Thijm, Tim Alberdingk and Beckett, Ryan and Gupta, Aarti and Walker, David},
title = {Kirigami, the Verifiable Art of Network Cutting},
year = {2022},
month = {February},
abstract = {Satisfiability Modulo Theories (SMT)-based analysis allows exhaustive reasoning over complex distributed control plane routing behaviors, enabling verification of routing under arbitrary conditions. To improve scalability of SMT solving, we introduce a modular verification approach to network control plane verification, where we cut a network into smaller fragments. Users specify an annotated cut which describes how to generate these fragments from the monolithic network, and we verify each fragment independently, using these 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 [25] - a network verification language and tool - and evaluate it on industrial topologies with synthesized policies. We observe a 10x improvement in end-to-end NV verification time, with SMT solve time improving by up to 6 orders of magnitude.},
url = {http://approjects.co.za/?big=en-us/research/publication/kirigami-the-verifiable-art-of-network-cutting/},
pages = {1-12},
journal = {2022 IEEE 30th International Conference on Network Protocols (ICNP)},
}