Trace based verification of parallel programs with shared variables

A partial correctness proof method for a language with parallel programs and shared variables based on reasoning about process traces is presented. A main advantage of the approach is that properties of each process are first proved in isolation. The properties of the complete system are then found by using these process properties in a proof rule for parallel composition. This supports a modular construction and verification technique. A (mythical) trace variable is added to each process. When a Boolean expression is evaluated, a side effect is to record in the trace variable, the expression and its (Boolean) value. Write operations are also recorded in the trace. It is possible to reduce the amount of information recorded in the trace variable and hence make the proofs of weak properties even more manageable. An example verification is given.<>