Efficient verification of network fault tolerance via counterexample-guided refinement

DOI10.1007/978-3-030-25543-5_18MaRDI QIDQ6154886zbMATH OpenOpenAlexFDO

Authors

Publication date 16 February 2024

Published in Computer Aided Verification (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-25543-5_18

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Scaling network verification using symmetry and surgery
• Efficient SMT-based network fault tolerance verification
• scientific article; zbMATH DE number 1670775
• scientific article; zbMATH DE number 1760005
• SAT based verification of network data planes

Cited in

(1)

• Efficient SMT-based network fault tolerance verification

This page was built for publication: Efficient verification of network fault tolerance via counterexample-guided refinement

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