Proving Properties of Parallel Programs: An Axiomatic Approach
Owicki, Susan S.; Gries, David
This 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.
computer science; technical report
Previously Published As