A review of specification and verification methods for parallel programs including the dataflow approach

Parallel programs are usually described informally, and these descriptions are implemented on parallel computer systems. When a program does not run correctly, it is often very difficult to determine whether the program description or the implementation is incorrect. This has led to a search for more formal descriptions of parallel programs and to proof systems for the verification of the implementations. Formal methods for the specification and verification of parallel programs are reviewed, and a new method that is based on dataflow graphs is described.<
>