Verifying properties of parallel programs: An axiomatic approach

The work

AuthorsSusan Owicki; David Gries
Editors
Typearticle
Year1976
Citekeyowicki1976verifying

Where it appeared

Published inCommunications of the ACM
PublisherAssociation for Computing Machinery (ACM)
Volume19
Issue5
Pages279--285

Identifiers

DOI10.1145/360051.360224
OpenAlexW1965662337

Related

Distinct fromowicki1975axiomatic
Distinct fromowicki1976axiomatic

Abstract

An axiomatic method for proving a number of properties of parallel programs is presented. Hoare has given a set of axioms for partial correctness, but they are not strong enough in most cases. This paper defines a more powerful deductive system which is in some sense complete for partial correctness. A crucial axiom provides for the use of auxiliary variables, which are added to a parallel program as an aid to proving it correct. The information in a partial correctness proof can be used to prove such properties as mutual exclusion, freedom from deadlock, and program termination. Techniques for verifying these properties are presented and illustrated by application to the dining philosophers problem.

A copy is held

pdf, 655.6 kB. Not published — it may be under copyright. The facts and links here are.

How it got here

How it got hereagent via bibtex
Added2026-08-05 00:00 UTC
Approved bya person 2026-08-23 14:12 UTC

Cite it as

@article{owicki1976verifying,
  title        = {Verifying properties of parallel programs: An axiomatic approach},
  author       = {Susan Owicki and David Gries},
  year         = {1976},
  journal      = {Communications of the ACM},
  publisher    = {Association for Computing Machinery (ACM)},
  volume       = {19},
  number       = {5},
  pages        = {279--285},
  doi          = {10.1145/360051.360224},
}

This record lives at https://refs.drheap.org/owicki1976verifying/ and will keep doing so.