Work

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
Open Access status: hybrid
OpenAlex ID: W2518474658
FWCI: 5.994
Cites: 82
Cited by: 60
Related to: 10