18 citations · 29 across the 2 of their papers we have counts for
2 papers
cs.LO2022★ 18 cited
Modular Control Plane Verification via Temporal Invariants
Timothy Alberdingk Thijm, Ryan Beckett, Aarti Gupta +1
Monolithic control plane verification cannot scale to hyperscale network architectures with tens of thousands of nodes, heterogeneous network policies and thousands of network chan…
cs.NI2022★ 11 cited
Kirigami, the Verifiable Art of Network Cutting
Tim Alberdingk Thijm, Ryan Beckett, Aarti Gupta +1
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 p…