HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

The Need for Language Support for Fault-tolerant Distributed Systems

Abstract : Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asyn-chronous 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.
Document type :
Conference papers
Complete list of metadata

Contributor : Cezara Dragoi Connect in order to contact the contributor
Submitted on : Tuesday, January 5, 2016 - 5:37:38 PM
Last modification on : Thursday, March 17, 2022 - 10:08:44 AM
Long-term archiving on: : Thursday, April 7, 2016 - 3:40:26 PM


Files produced by the author(s)




Cezara Drăgoi, Thomas Henzinger, Damien Zufferey. The Need for Language Support for Fault-tolerant Distributed Systems. Leibniz International Proceedings in Informatics (LIPIcs) , May 2015, Dagstuhl, Germany. pp.90-102, ⟨10.4230/LIPIcs.SNAPL.2015.90⟩. ⟨hal-01251194⟩



Record views


Files downloads