Reduction-Based Formal Analysis of BGP Instances
Abstract elided by the publisher.
Related papers
- Scalable verification of border gateway protocol configurations with an SMT solver OOPSLA 2016
- Fast BGP Simulation of Large Datacenters VMCAI 2019
- Effective floating-point analysis via weak-distance minimization PLDI 2019
- Parallelizing Complex Scans and Reductions PLDI 1994
- Reduction of Nondeterministic Tree Automata TACAS 2016
- SpaceSearch: a library for building and verifying solver-aided tools ICFP 2017
- Interprocedural analysis of asynchronous programs POPL 2007
- FlowCFL: generalized type-based reachability analysis: graph reduction and equivalence of CFL-based and type-based reachability OOPSLA 2020