Owicki, Susan S.Gries, David2007-04-232007-04-231975-05http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR75-243https://hdl.handle.net/1813/6638This paper presents an axiomatic technique for proving a number of properties of parallel programs. Hoare has given a set of axioms for partial correctness of parallel programs, but they are not strong enough in most cases. Here we define a deductive system which is in some sense complete for partial correctness. The information in a partial correctness proof is then used to prove such properties as mutual exclusion, blocking and termination.962751 bytes513371 bytesapplication/pdfapplication/postscripten-UScomputer sciencetechnical reporttechnical report