Skip to main content
Conference ProceedingsOPEN ACCESS

Formal analysis of a distributed algorithm for tracking progress

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7892 LNCS 5-19
DOI: 10.1007/978-3-642-38592-6_2
4Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Tracking the progress of computations can be both important and delicate in distributed systems. In a recent distributed algorithm for this purpose, each processor maintains a delayed view of the pending work, which is represented in terms of points in virtual time. This paper presents a formal specification of that algorithm in the temporal logic TLA, and describes a mechanically verified correctness proof of its main properties. © 2013 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Abadi, M., McSherry, F., Murray, D. G., & Rodeheffer, T. L. (2013). Formal analysis of a distributed algorithm for tracking progress. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7892 LNCS, pp. 5–19). https://doi.org/10.1007/978-3-642-38592-6_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free