Article,

An axiomatic proof technique for parallel programs I

, and .
Acta Informatica, 6 (4): 319--340 (December 1976)

Abstract

A language for parallel programming, with a primitive construct for synchronization and mutual exclusion, is presented. Hoare's deductive system for proving partial correctness of sequential programs is extended to include the parallelism described by the language. The proof method lends insight into how one should understand and present parallel programs. Examples are given using several of the standard problems in the literature. Methods for proving termination and the absence of deadlock are also given. ER -

Tags

Users

  • @giuliano.losa

Comments and Reviews