Verifying Properties of Parallel Programs: An Axiomatic Approach.
Uloženo v:
| Název: | Verifying Properties of Parallel Programs: An Axiomatic Approach. |
|---|---|
| Autoři: | Owicki, Susan1, Gries, David1, Gaines, R. S. |
| Zdroj: | Communications of the ACM. May76, Vol. 19 Issue 5, p279-285. 7p. 1 Diagram. |
| Témata: | *PARALLEL programming, *COMPUTER programming, *COMPUTER software, SOFTWARE verification, AXIOMS, METHODOLOGY |
| Abstrakt: | An axiomatic method for proving a number of properties of parallel programs is presented. Hoare has given a set of axioms for partial correctness, but they are not strong enough in most cases. This paper defines a more powerful deductive system which is in some sense complete for partial correctness. A crucial axiom provides for the use of auxiliary variables, which are added to a parallel program as an aid to proving it correct. The information in a partial correctness proof can be used to prove such properties as mutual exclusion, freedom from deadlock, and program termination. Techniques for verifying these properties are presented and illustrated by application to the dining philosophers problem. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Databáze: | Business Source Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Buďte první, kdo okomentuje tento záznam!