Reduction: A Method of Proving Properties of Parallel Programs.
Saved in:
| Title: | Reduction: A Method of Proving Properties of Parallel Programs. |
|---|---|
| Authors: | Lipton, Richard J.1 |
| Source: | Communications of the ACM. Dec1975, Vol. 18 Issue 12, p717-721. 5p. |
| Subjects: | Parallel programming, Computer programming, Parallel logic programming, Programming languages, Computational linguistics, Information theory, Logic programming, Artificial languages, Computer software |
| Abstract: | When proving that a parallel program has a given property it is often convenient to assume that a statement is indivisible, i.e. that the statement cannot be interleaved with the rest of the program. Here sufficient conditions are obtained to show that the assumption that a statement is indivisible can be relaxed and still preserve properties such as halting. Thus correctness proofs of a parallel system can often be greatly simplified. [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.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
