A case study on parametric verification of failure detectors
From MaRDI portal
Publication:5883746
DOI10.46298/lmcs-19(1:17)2023OpenAlexW4323317975MaRDI QIDQ5883746
No author found.
Publication date: 22 March 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.08826v4
Related Items (1)
Uses Software
Cites Work
- Stutter-invariant temporal properties are expressible without the next-time operator
- Proving properties of a ring of finite-state machines
- A theory of timed automata
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- Uppaal in a nutshell
- Making Byzantine consensus live
- Cutoff bounds for consensus algorithms
- Understanding concurrent systems
- On implementing omega in systems with weak reliability and synchrony assumptions
- Unreliable failure detectors for reliable distributed systems
- Decidability of Parameterized Verification
- TLA + Proofs
- Computer Science Logic
- CONCUR 2004 - Concurrency Theory
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- A case study on parametric verification of failure detectors
- Correct Hardware Design and Verification Methods
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A case study on parametric verification of failure detectors
