Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/23266
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFrancalanza, Adrian-
dc.contributor.authorHennessy, Matthew-
dc.date.accessioned2017-10-31T15:26:11Z-
dc.date.available2017-10-31T15:26:11Z-
dc.date.issued2007-
dc.identifier.citationFrancalanza, A., & Hennessy, M. (2007). Proving distributed algorithm correctness using fault tolerance bisimulations. 16th European Symposium on Programming, Braga. 1-19.en_GB
dc.identifier.urihttps://www.um.edu.mt/library/oar//handle/123456789/23266-
dc.description.abstractThe possibility of partial failure occuring at any stage of computation complicates rigorous formal treatment of distributed algorithms. We propose a methodology for formalising and proving the correctness of distributed algorithms which alleviates this complexity. The methodology uses fault-tolerance bisimulation proof techniques to split the analysis into two phases, that is a failure-free phase and a failure phase, permitting separation of concerns. We design a minimal partial-failure calculus, develop a corresponding bisimulation theory for it and express commit and consensus algorithms in the calculus. We then use the consensus example and the calculus theory as the framework in which to demonstrate the benefits of our methodology.en_GB
dc.language.isoenen_GB
dc.publisherEuropean Joint Conferences on Theory and Practice of Software (ETAPS)en_GB
dc.rightsinfo:eu-repo/semantics/openAccessen_GB
dc.subjectSoftware architectureen_GB
dc.subjectIntegrated softwareen_GB
dc.subjectSoftware engineeringen_GB
dc.subjectEnterprise application integration (Computer systems)en_GB
dc.subjectComputational complexityen_GB
dc.subjectDistributed algorithmsen_GB
dc.subjectComputer arithmeticen_GB
dc.titleProving distributed algorithm correctness using fault tolerance bisimulationsen_GB
dc.typeconferenceObjecten_GB
dc.rights.holderThe 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 holderen_GB
dc.bibliographicCitation.conferencename16th European Symposium on Programmingen_GB
dc.bibliographicCitation.conferenceplaceBraga Portugal, 24/03-1/04/2007en_GB
dc.description.reviewedpeer-revieweden_GB
Appears in Collections:Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
Proving_Distributed_Algorithm_Correctness_using_Fa.pdf142.84 kBAdobe PDFView/Open


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