Efficient Verification of Network Fault Tolerance via Counterexample-Guided Refinement

Giannarakis, Nick; Beckett, Ryan; Mahajan, Ratul; Walker, David

doi:10.1007/978-3-030-25543-5_18

Cited by 12 publications

(11 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, the time of verification programming may be out of control. Though some tools aim to improve the efficiency of verifying the reachability of the network by compressing the scale of the large network [19] or abstracting the control plane in a systematic form [15], they are obviously at the cost of losing the possibility of verifying QoS network properties. Therefore, it is still a significant and challenging issue to model and encode the network concisely and concretely.…”

Section: Conclusion and Discussionmentioning

confidence: 99%

“…The operates on the routes in lexicographic order. In other words, can be treated as the total order that ranks and models the routing decision procedure using some combination of record fields [19], [20]. For example, if a router receives two records of different protocols, we just compare the ad values of the two records to obtain a better one.…”

Section: B Abstract the Graph To Algebra Structurementioning

confidence: 99%

See 1 more Smart Citation

Enhanced Logical Representations of a Real Network Based on an Algebraic Model

2020

View full text Add to dashboard Cite

The algebraic model and logical representations of a real network are important but very challenging issues in automatic network verification. In this paper, we abstract the concrete network to its corresponding abstract graph with enhanced vertices and edges by splitting the vertices according to the protocols that they run. Based on classical routing algebra, we consider combining the interactions of different protocols and routing records and then give a newly modified algebraic structure. To apply the abstract modified algebra routing into the concrete network, we make use of the SMT solver to encode the components of algebra into logical constraints motivated by the work of Ryan Beckett et al. By encoding the network behaviors and properties into logical formulas, we can compute whether the experimental network that we configured satisfies any property, including reachability, routing loop, and so on. In the previous work, the routing algebra or the representation of the network is only applied to several network properties. However, in this paper, we extract all kinds of properties into exact logical formulas. INDEX TERMS Logical formula, network verification, network protocols, routing algebra, SMT.

show abstract

Section: Conclusion and Discussionmentioning

confidence: 99%

Section: B Abstract the Graph To Algebra Structurementioning

confidence: 99%

Enhanced Logical Representations of a Real Network Based on an Algebraic Model

2020

View full text Add to dashboard Cite

show abstract

“…(1) high branching factors (e.g., conditionals with many branches because there are many different possible destinations) [Beckett et al 2019a;Giannarakis et al 2020], and (2) many symmetries (e.g., topologies used in datacenters are highly symmetric in part to tolerate failures; and many destinations may share common processing components and generate similar routes) [Beckett et al 2018;Giannarakis et al 2019Giannarakis et al , 2020Plotkin et al 2016] (3) a large number of simple, repeated computations.…”

Section: Efficient Symbolic Simulationmentioning

confidence: 99%

“…Perhaps, the surprising part is that the simulation struggles the most with datacenter networks. Prior work [Giannarakis et al 2019[Giannarakis et al , 2020 suggested that networks with highly symmetric designs, such as Fat Trees, are amenable to fault-tolerance analyses due to their high degree of redundancy. However, in our case, simulation fails to compute routes even for a relatively small Fat Tree network with 216 links Ðthese networks can scale to hundreds of nodes and several thousand links.…”

Section: Verification Performancementioning

confidence: 99%

ProbNV: probabilistic verification of network control planes

Giannarakis

Silva

Walker

2021

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

ProbNV is a new framework for probabilistic network control plane verification that strikes a balance between generality and scalability. ProbNV is general enough to encode a wide range of features from the most common protocols (eBGP and OSPF) and yet scalable enough to handle challenging properties, such as probabilistic all-failures analysis of medium-sized networks with 100-200 devices. When there are a small, bounded number of failures, networks with up to 500 devices may be verified in seconds. ProbNV operates by translating raw CISCO configurations into a probabilistic and functional programming language designed for network verification. This language comes equipped with a novel type system that characterizes the sort of representation to be used for each data structure: concrete for the usual representation of values; symbolic for a BDD-based representation of sets of values; and multi-value for an MTBDD-based representation of values that depend upon symbolics. Careful use of these varying representations speeds execution of symbolic simulation of network models. The MTBDD-based representations are also used to calculate probabilistic properties of network models once symbolic simulation is complete. We implement the language and evaluate its performance on benchmarks constructed from real network topologies and synthesized routing policies.

show abstract

“…In verification of computer networks, however, the properties to be verified usually concern delivery of packets rather than the functioning of the algorithm implemented by the network. Symmetries in computer networks were used to simplify formal verification in [38]- [40].…”

Section: Related Workmentioning

confidence: 99%

Symmetry Breaking in Model Checking of Fault-Tolerant Nuclear Instrumentation and Control Systems

Buzhinsky

Pakonen

2020

IEEE Access

View full text Add to dashboard Cite

One of the approaches to assure reliability of nuclear instrumentation and control (I&C) systems is model checking, a formal verification technique. Model checking is computationally demanding, but nuclear I&C systems have certain properties that simplify the verification problem. The most notable of these properties are redundancy (duplication of certain system parts in several divisions) and symmetry, which are the means of ensuring failure tolerance. In this work, we extend our previous method of model checking failure tolerance of nuclear I&C systems by proposing an automated symmetry breaking approach that utilizes these properties to simplify the verification problem. As a result, fewer failure combinations need to be checked. We evaluate this approach on a case study that encompasses three safety functions allocated to four I&C systems in the same I&C model. INDEX TERMSFormal verification, model checking, symmetry breaking, nuclear I&C systems, fault tolerance.

show abstract

Efficient Verification of Network Fault Tolerance via Counterexample-Guided Refinement

Cited by 12 publications

References 23 publications

Enhanced Logical Representations of a Real Network Based on an Algebraic Model

Enhanced Logical Representations of a Real Network Based on an Algebraic Model

ProbNV: probabilistic verification of network control planes

Symmetry Breaking in Model Checking of Fault-Tolerant Nuclear Instrumentation and Control Systems

Contact Info

Product

Resources

About