A theorem on atomicity in distributed algorithms (1990) [13 citations — 0 self]
Abstract:
DEC's business and technology objectives require a strong research program. The Systems Research Center (SRC) and three other research laboratories are committed to filling that need. SRC began recruiting its first research scientists in l984---their charter, to advance the state of knowledge in all aspects of computer systems research. Our current work includes exploring high-performance personal computing, distributed computing, programming environments, system modelling techniques, specification technology, and tightly-coupled multiprocessors. Our approach to both hardware and software research is to create and use real systems so that we can investigate their properties fully. Complex systems cannot be evaluated solely in the abstract. Based on this belief, our strategy is to demonstrate the technical and practical feasibility of our ideas by building prototypes and using them as daily tools. The experience we gain is useful in the short term in enabling us to refine our designs, and invaluable in the long term in helping us to advance the state of knowledge
Citations
| 300 | Defining liveness – Alpern, Schneider - 1985 |
| 257 | An Axiomatic Proof Technique for Parallel Programs I – Owicki, Gries - 1976 |
| 229 | A Distributed Algorithm for Minimum-Weight Spanning Tree – Gallager, Humblet, et al. - 1983 |
| 93 | Reduction: A method of proving properties of parallel programs – Lipton - 1975 |
| 32 | Compositional Verification of Distributed Systems – Jonsson - 1987 |
| 22 | Parallel program correctness through refinement.In – Doeppner - 1977 |
| 3 | When messages may crawl – Dijkstra - 1979 |
| 3 | Pretending Atomicity. research report 44 – Lamport, Schneider - 1989 |
