ByMC
From MaRDI portal
Cited in
(16)- Petruchio
- TLA
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems
- PlusCal
- Liveness in broadcast networks
- PSync
- Distal
- TravMC2
- Verdi
- Chapar
- Parity to safety in polynomial time for pushdown and collapsible pushdown systems
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- Verification of randomized consensus algorithms under round-rigid adversaries
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
This page was built for software: ByMC