Work

Hierarchical correctness proofs for distributed algorithms

Year: 1987

Type: conference-paper

Abstract: : We introduce the input-output automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular, hierarchical correctness proofs for distributed algorithms. We de ne this model, and give aninteresting example of how itcan be used to construct such proofs. 1

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/41840.41852

Authors: Nancy A. Lynch, Mark R. Tuttle

Institution: Massachusetts Institute of Technology

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2000302396

FWCI: 30.73

Cites: 25

Cited by: 772

Related to: 10