2026-07-22T06:30:42Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5019 2024-03-06T10:35:42Z ddc:004 open_access

The Need for Language Support for Fault-Tolerant Distributed Systems Dragoi, Cezara Henzinger, Thomas A. Zufferey, Damien Programming language Fault-tolerant distributed algorithms Automated verification Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asynchronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. Nonetheless there is surprisingly little language and verification support to build distributed systems based on fault-tolerant algorithms. In this paper, we present some of the challenges that a designer has to overcome to implement a fault-tolerant distributed system. Then we review different models that have been proposed to reason about distributed algorithms and sketch how such a model can form the basis for a domain-specific programming language. Adopting a high-level programming model can simplify the programmer's life and make the code amenable to automated verification, while still compiling to efficiently executable code. We conclude by summarizing the current status of an ongoing language design and implementation project that is based on this idea. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Cezara Dragoi and Thomas A. Henzinger and Damien Zufferey 2015 Is Part Of LIPIcs, Volume 32, 1st Summit on Advances in Programming Languages (SNAPL 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SNAPL.2015.90 urn:nbn:de:0030-drops-50192 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SNAPL.2015.90 eng https://creativecommons.org/licenses/by/3.0/legalcode