ByMC

swMATH21699MaRDI QIDQ33501FDOQ33501

Author name not available (Why is that?)

Described by source

• Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker

Cited In (8)

• Higher-order quantifier elimination, counter simulations and fault-tolerant systems
• Tutorial on parameterized model checking of fault-tolerant distributed algorithms
• On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
• Parity to safety in polynomial time for pushdown and collapsible pushdown systems
• Liveness in broadcast networks
• A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
• Title not available (Why is that?)
• \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms

This page was built for software: ByMC