Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/23050
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zammit, Mandy | - |
dc.contributor.author | Francalanza, Adrian | - |
dc.date.accessioned | 2017-10-27T12:30:42Z | - |
dc.date.available | 2017-10-27T12:30:42Z | - |
dc.date.issued | 2012-11 | - |
dc.identifier.citation | Francalanza, A., & Zammit, M. (2012). Formal fault-tolerance proofs for distributed algorithms. Computer Science Annual Workshop CSAW’12, Msida. 24-25. | en_GB |
dc.identifier.uri | https://www.um.edu.mt/library/oar//handle/123456789/23050 | - |
dc.description.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). | en_GB |
dc.language.iso | en | en_GB |
dc.publisher | University of Malta. Faculty of ICT | en_GB |
dc.rights | info:eu-repo/semantics/openAccess | en_GB |
dc.subject | Distributed algorithms | en_GB |
dc.subject | Natural language processing (Computer science) | en_GB |
dc.subject | Fault-tolerant computing | en_GB |
dc.title | Formal fault-tolerance proofs for distributed algorithms | en_GB |
dc.type | conferenceObject | en_GB |
dc.rights.holder | The copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder. | en_GB |
dc.bibliographicCitation.conferencename | Computer Science Annual Workshop CSAW’12 | en_GB |
dc.bibliographicCitation.conferenceplace | Msida, Malta, 8-9/11/2012 | en_GB |
dc.description.reviewed | peer-reviewed | en_GB |
Appears in Collections: | Scholarly Works - FacICTCS Scholarly Works - FacM&SMed |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Proceedings of CSAW12 - A11.pdf | 366.86 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.