Hierarchical correctness proofs for distributed algorithms

Abstract

Article Hierarchical correctness proofs for distributed algorithms Share on Authors: Nancy A. Lynch Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MassachusettsView Profile , Mark R. Tuttle Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MassachusettsView Profile Authors Info & Claims PODC '87: Proceedings of the sixth annual ACM Symposium on Principles of distributed computingDecember 1987 Pages 137–151https://doi.org/10.1145/41840.41852Online:01 December 1987Publication History 461citation1,135DownloadsMetricsTotal Citations461Total Downloads1,135Last 12 Months44Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access