Please use this identifier to cite or link to this item:
Title: Proving distributed algorithm correctness using fault tolerance bisimulations
Authors: Francalanza, Adrian
Hennessy, Matthew
Keywords: Software architecture
Integrated software
Software engineering
Enterprise application integration (Computer systems)
Computational complexity
Distributed algorithms
Computer arithmetic
Issue Date: 2007
Publisher: European Joint Conferences on Theory and Practice of Software (ETAPS)
Citation: Francalanza, A., & Hennessy, M. (2007). Proving distributed algorithm correctness using fault tolerance bisimulations. 16th European Symposium on Programming, Braga. 1-19.
Abstract: The 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.
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.