Chandy, K. Mani (1993) Using Triples to Reason About Concurrent Programs. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-02
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_postscript.png)
|
Postscript
See Usage Policy. 936Kb | |
![[img]](http://authors.library.caltech.edu/style/images/fileicons/other.png)
|
Other (Adobe PDF (809KB))
See Usage Policy. 789Kb |
Use this Persistent URL to link to this item: http://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) |
|---|---|
| Group: | Computer Science Technical Reports |
| Record Number: | CaltechCSTR:1993.cs-tr-93-02 |
| Persistent URL: | http://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: | 26 Dec 2012 14:07 |
Repository Staff Only: item control page
