Efficient SMT-based network fault tolerance verification

DOI10.1007/978-3-031-27481-7_7MaRDI QIDQ6174529zbMATH OpenFDO

Authors

Publication date 17 August 2023

Published in Formal Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-27481-7_7

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Efficient verification of network fault tolerance via counterexample-guided refinement
• SAT based verification of network data planes
• Scaling network verification using symmetry and surgery
• Computational verification of network programs in Coq
• SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms

Cites work

• A parametric approach for smaller and better encodings of cardinality constraints
• Efficient verification of network fault tolerance via counterexample-guided refinement
• Scaling network verification using symmetry and surgery

Cited in

(2)

• Fault-Tolerance Distributed Control Plane for Software Defined Networks
• Efficient verification of network fault tolerance via counterexample-guided refinement

This page was built for publication: Efficient SMT-based network fault tolerance verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174529)