Skip Navigation

The Computer Journal 1989 32(5):437-444; doi:10.1093/comjnl/32.5.437
© 1989 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mancini, L. V.
Right arrow Articles by Pappalardo, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Proving Correctness Properties of a Replicated Synchronous Program

L. V. Mancini2 § and G. Pappalardo1,3 * ¶

1 Computing Laboratory, University of Newcastle upon Tyne, UK, 2 Dipartimento di Informatica, Universita di Pisa, Italy, 3 Universita di Reggio Calabria, Italy

Replicated synchronous programs executed by a set of possibly faulty processors find a natural application in the fault-tolerance technique known as N-Modular Redundancy (NMR). We present an axiomatic approach to correctness proofs for replicated synchronous programs and illustrate its application by studying an agreement protocol for NMR distributed computing.

Received April 1987. revised March 1988.

* Computing Laboratory, University of Newcastle upon Tyne

§ Dipartimento di Informatica, Università di Pisa, Italy

Università di Reggio Calabria, Italy


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.