Reduction
- 1 December 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 18 (12) , 717-721
- https://doi.org/10.1145/361227.361234
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.Keywords
This publication has 2 references indexed in Scilit:
- Synchronization of communicating processesCommunications of the ACM, 1972
- The application of program-proving techniques to the verification of synchronization processesPublished by Association for Computing Machinery (ACM) ,1972