A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
Year: 2016
Type: conference-paper
Abstract: Distributed algorithms have many mission-critical applications ranging from embedded systems and replicated databases to cloud computing. Due to asynchronous communication, process faults, or network failures, these algorithms are difficult to design and verify. Many algorithms achieve fault tolerance by using threshold guards that, for instance, ensure that a process waits until it has received an acknowledgment from a majority of its peers. Consequently, domain-specific languages for fault-tolerant distributed systems offer language support for threshold guards.
Authors: Igor Konnov, Marijana Lazić, Helmut Veith, Josef Widder
Institution: TU Wien
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Awards: APALACHE: Abstraction-based Parameterized TLA Checker, Glucose metabolism in Insulin resistant rat skeletal muscle. Sensitivity to the action of Insulin-like compounds and modulation by Troglitazone., PRAVDA - Parametrized Verification of Fault-tolerant Distributed Algorithms, Coordination: Rigorous Systems Engineering (RiSE), Thoraco - abdominal compression decompression for CPR (TACD-CPR), G8501547954, Logical Methods in Computer Science
OpenAlex ID: W2518474658
