The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Hierarchical correctness proofs for distributed algorithms
The work
| Authors | Nancy Ann Lynch; Mark R. Tuttle |
|---|---|
| Editors | |
| Type | misc |
| Year | 1987 |
| Citekey | lynch1987hierarchical |
Where it appeared
| Published in | ACM Symposium on Principles of Distributed Computing (PODC) |
|---|---|
| Pages | 137--151 |
Identifiers
| DOI | 10.1145/41840.41852 |
|---|---|
| OpenAlex | W2000302396 |
Access
| Landing page | https://doi.org/10.1145/41840.41852 |
|---|
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
Abstract
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
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-23 22:14 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@misc{lynch1987hierarchical,
title = {Hierarchical correctness proofs for distributed algorithms},
author = {Nancy Ann Lynch and Mark R. Tuttle},
year = {1987},
journal = {ACM Symposium on Principles of Distributed Computing (PODC)},
pages = {137--151},
doi = {10.1145/41840.41852},
}
This record lives at https://refs.drheap.org/lynch1987hierarchical/ and will keep doing so.