Abstract not found

This paper illustrates a method for the design of parallel programs that is based on the separation of computation and coordination. We use Gamma programs to specify computations and show how to prove their corr ectness using a UNITYlike programming logic. A separate coordinationlanguage is used to determine behavioural aspects of the program. We illustr ate how behaviour can be structured through a process of suc cessive stepwise refinements. R easoning ab out refinement is supported formally by two types of simulation. As an illustration of our method we study the problem of solving triangular systems of linear equations. F or this problem we derive a number of known algorithms and show how they are relate d by our refinement ordering.