Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

PODC
1987
ACM

favoriteEmaildiscussreport

75views Distributed and Parallel Com...» more PODC 1987»

Hierarchical Correctness Proofs for Distributed Algorithms

13 years 8 months ago

Hierarchical Correctness Proofs for Distributed Algorithms

Download www.markrtuttle.com

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 an interesting example of how it can be used to construct such proofs.

Nancy A. Lynch, Mark R. Tuttle

Real-time Traffic

Asynchronous Distributed Networks | Distributed And Parallel Computing | Hierarchical Correctness Proofs | Input-output Automaton | PODC 1987 |

claim paper

Related Content

» A Protocol and Correctness Proofs for RealTime HighPerformance Broadcast Networks

» The Correctness of the Fast Fourier Transform A Structured Proof in ACL2

» Mechanically Verifying the Correctness of the Fast Fourier Transform in ACL2

» Quasi Serializability a Correctness Criterion for Global Concurrency Control in InterBase

» Verifying Selfstabilizing Population Protocols with Coq

» A Fully Distributed Location Management Scheme for Large PCS

» IO Automaton Models and Proofs for SharedKey Communication Systems

» Nonatomic dual bakery algorithm with bounded tokens

» Integrating Computer Algebra into Proof Planning

Post Info
More Details (n/a)

Added	28 Aug 2010
Updated	28 Aug 2010
Type	Conference
Year	1987
Where	PODC
Authors	Nancy A. Lynch, Mark R. Tuttle

Comments (0)