|Title:||Proof Rules for Communication Abstractions
|Authors:||G. Talilienfeld and N. Francez
|Abstract:||A modular proof system is presented for proving partial correctness and freedom from deadlock of concurrent programs using scripts (including recursive scripts). Its applications to augmentations of CSP and a subset of ADA are discussed. The proof rules are a generalization of both the procedure rules and the concurrency rules. Correctness proofs for examples are presented.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1984/CS/CS0332), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1984
To the main CS technical reports page
Computer science department, Technion