Abstractions for fault-tolerant distributed system verification
From MaRDI portal
Recommendations
- Modular abstractions for verifying real-time distributed systems
- Failure-aware runtime verification of distributed systems
- A modular framework for verifying versatile distributed systems
- On Verifying Fault Tolerance of Distributed Protocols
- A verification approach for distributed abstract state machines
- Automatic verification for a class of distributed systems
- Verifying distributed systems: the operational approach
Cited in
(14)- Machine checked proofs of the design of a fault-tolerant circuit
- A trace-based compositional proof theory for fault tolerant distributed systems
- Abstractions for fault-tolerant global computing
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems
- Distributed speculative execution for reliability and fault tolerance: an operational semantics
- Accuracy of message counting abstraction in fault-tolerant distributed algorithms
- A verification approach for distributed abstract state machines
- scientific article; zbMATH DE number 3926229 (Why is no real title available?)
- scientific article; zbMATH DE number 4080970 (Why is no real title available?)
- Abstraction and testing
- A case study in the mechanical verification of fault tolerance
- Static Analysis
- Abstracting communication to reason about distributed algorithms
- Automated analysis of fault-tolerance in distributed systems
This page was built for publication: Abstractions for fault-tolerant distributed system verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464653)