Using Triples to Reason About Concurrent Programs

Authors:
K. M Chandy
Affiliations:
-
Venue:
Using Triples to Reason About Concurrent Programs
Year:
1993

Citing 0
Cited 1

Specification and refinement of a message router

IWSSD '93 Proceedings of the 7th international workshop on Software specification and design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rules for the Hoare triple, familiar to programmers from their experience with sequential programming, can be applied to develop proofs of concurrent programs as well. The basis for the adaptations of the Hoare triple is temporal logic.