Using Triples to Reason About Concurrent Programs

Chandy, K. Mani (1993) Using Triples to Reason About Concurrent Programs. Computer Science Technical Reports, California Institute of Technology , Pasadena, CA. (Unpublished) https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-02

Preview

Postscript - Submitted Version
See Usage Policy.
958kB

Preview

PDF - Submitted Version
See Usage Policy.
808kB

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-02

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.

Item Type:	Report or Paper (Technical Report)
Additional Information:	© 1993 California Institute of Technology. Thanks at Caltech to U. Binau, M. van der Goot, P. Hofstee, R. Leino, B. Massingill, A. Rifkin, P. Sivilotti, J. van de Snepscheut, L. Lamport, J. Misra and A. Singh for their careful reading. Special thanks to Rustan Leino for pointing out the identity element and the idempotence of parallel composition, and for strengthening some theorems by replacing implication by equality.
Group:	Computer Science Technical Reports
Series Name:	Computer Science Technical Reports
DOI:	10.7907/Z94Q7S2R
Record Number:	CaltechCSTR:1993.cs-tr-93-02
Persistent URL:	https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-02
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:	26855
Collection:	CaltechCSTR
Deposited By:	Imported from CaltechCSTR
Deposited On:	14 May 2001
Last Modified:	03 Oct 2019 03:18

Repository Staff Only: item control page