Please use this identifier to cite or link to this item:
Title: Formal fault-tolerance proofs for distributed algorithms
Authors: Zammit, Mandy
Francalanza, Adrian
Keywords: Distributed algorithms
Natural language processing (Computer science)
Fault-tolerant computing
Issue Date: 2012-11
Publisher: University of Malta. Faculty of ICT
Citation: Francalanza, A., & Zammit, M. (2012). Formal fault-tolerance proofs for distributed algorithms. Computer Science Annual Workshop CSAW’12, Msida. 24-25.
Abstract: Distributed Algorithms express problems as concurrent failing processes which co- operate and interact towards a common goal. Such algorithms arise in a wide range of applications, including distributed information processing, banking systems and airline reservation systems amongst others. It is desirable that distributed algorithms are well be- haved both in a failure free environment and even in the presence of failure (i.e. fault tolerant). To ensure well behavedness for all executions of distributed algorithms formal correctness proofs are needed. This is due to the concurrent nature of such algorithms, where executions of the algorithms result in different interleavings amongst parallel pro- cesses (i.e. there is a large number of possible execution paths).
Appears in Collections:Scholarly Works - FacICTCS
Scholarly Works - FacM&SMed

Files in This Item:
File Description SizeFormat 
Proceedings of CSAW12 - A11.pdf366.86 kBAdobe PDFView/Open

Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.