Accession Number:

ADA280121

Title:

Verifying Programs That Use Causally-Ordered Message-Passing

Descriptive Note:

Interim rept.

Corporate Author:

CORNELL UNIV ITHACA NY DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Stoller, Scott D.
• Schneider, Fred B.

Report Date:

1994-05-15

Pagination or Media Count:

27.0

Abstract:

We give an operational model of causally-ordered message-passing primitives. Based on this model, we formulate a Hoare-style proof system for causally-ordered delivery. To illustrate the use of this proof system and to demonstrate the feasibility of applying invariant-based verification techniques to algorithms that depend on causally-ordered delivery, we verify an- asynchronous variant of the distributed termination detection algorithm of Dijkstra, Feijen, and van Gasteren. Verification, Message-passing, Causal delivery.

Descriptors:

• *ALGORITHMS
• *VERIFICATION
• *PROGRAMMING LANGUAGES
• *MESSAGE PROCESSING
• DELIVERY
• DISTRIBUTION
• ASYNCHRONOUS COMPUTERS
• INVARIANCE
• MATHEMATICS
• COMPUTERS
• MODELS
• DETECTION

Subject Categories:

• Numerical Mathematics
• Computer Programming and Software
• Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE