Access Restriction

Author Gries, David ♦ Owicki, Susan
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Concurrent processes ♦ Correctness proofs ♦ Deadlock ♦ Mutual exclusion ♦ Structured multiprogramming ♦ Synchronization ♦ Program verification
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.
Description Affiliation: Cornell Univ., Ithaca, NY (Owicki, Susan; Gries, David)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 19
Issue Number 5
Page Count 7
Starting Page 279
Ending Page 285

Open content in new tab

   Open content in new tab
Source: ACM Digital Library