By Topic

Causality versus time: how to specify and verify distributed algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Garg, V.K. ; Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA ; Tomlinson, A.I.

This paper presents and advocates a method for formally specifying and verifying distributed programs. The method, which is based on the partial order of local states generated during execution, avoids the notion of time or physical global state. Programs are specified by documenting the relationship between states which are adjacent to each other in the partial order. Program properties are proven using induction on the happens-before relation and its complement. The technique is illustrated by specifying and proving Lamport's algorithm for mutual exclusion

Published in:

Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on

Date of Conference:

26-29 Oct 1994