College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||Using Message Passing for Distributed Programming: Proof Rules and Disciplines|
|Authors: ||Schlichting, Richard D.|
Schneider, Fred B.
|Keywords: ||computer science|
|Issue Date: ||May-1982|
|Publisher: ||Cornell University|
|Abstract: ||Inference rules are derived for proving partial correctness of concurrent programs that use message passing. These rules extend the notion of a satisfaction proof, first proposed for proving correctness of programs that use synchronous message-passing, to asynchronous message-passing, rendezvous, and remote procedures. Two types of asynchronous message-passing are considered: unreliable datagrams and reliable virtual circuits. The proof rules show how interference can arise and be controlled.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.