Reduction: A Method of Proving Properties of Parallel Programs

Communications of the ACM

Volumn 18, Issue 12, 1975, Pages 717-721

  Lipton, Richard J ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

computation sequence; deadlock free; indivisible; interruptible; parallel program; process; reduction; semaphore; verification method

Indexed keywords

COMPUTER METATHEORY;

EID: 0016592810     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/361227.361234     Document Type: Article

References (6)

1. Ashcroft, E.A. Proving assertions about parallel programs. Research Rep. CS-73-01, Dep. of Applied Analysis and Computer Sci., U. of Waterloo, 1973.
2. Dijkstra, E.W. Cooperating sequential processes. In Programming Languages, F. Genuys (Ed.), Academic Press, 1968, pp. 43-112.
3. Floyd, R.W. Assigning meanings to programs. In Mathematical Aspects of Computer Science, Amer. Math. Soc., 1967, pp. 19-32.
4. Habermann, A.N. Synchronization of communicating processes. Comm. ACM 15, 3 (March 1972), 171-176.
5. Lauer, H.C. Correctness in operating systems. Ph.D. Th, Carnegie-Mellon University, 1972.
6. Levitt, K.N. The application of program proving techniques to the verification of synchronization processes. AFIPS Conf. Proc., Vol. 41, Part 1, 1972. Fall Joint Computer Conference, AFIPS Press, Montvale, N.J., 1972, pp. 33-47.