On reductions of parallel programs
By a reduction of a parallel program, as informally introduced by Lipton, the number of possible execution sequences is decreased, which facilitates analysis and verification. This method is extended to simplify verification proofs of parallel programs.
Unable to display preview. Download preview PDF.
- /Kw/.KWONG, Y. S., On Reduction of Asynchronous Systems, Theoretical Computer Science 5(1977), 25–50Google Scholar
- /Li/.LIPTON, R. J., Reduction: A Method of Proving Peoperties of Parallel Programs, Comm. ACM 18(1975) 12, 717–721Google Scholar
- /OG/.OWICKI, S., GRIES, P., An Axiomatic Proof Techniques for Parallel Programs I, Acta Informatica 6(1976), 319–340Google Scholar