The application of program-proving techniques to the verification of synchronization processes

Authors:
Karl N. Levitt
Affiliations:
Stanford Research Institute, Menlo Park, California
Venue:
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Year:
1972

Citing 9
Cited 1

An Assessment of Techniques for Proving Program Correctness

ACM Computing Surveys (CSUR)
Synchronization of communicating processes

Communications of the ACM
Comments on prevention of system deadlocks

Communications of the ACM
Certification of algorithm 245 [M1]:treesort 3:proof of algorithms—a new kind of certification

Communications of the ACM
Concurrent control with “readers” and “writers”

Communications of the ACM
The structure of the “THE”-multiprogramming system

Communications of the ACM
The current state of proving programs correct

ACM '72 Proceedings of the ACM annual conference - Volume 1
Toward a man-machine system for proving program correctness

Toward a man-machine system for proving program correctness
A program verifier

A program verifier

Proving assertions about parallel programs

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this paper is to establish the applicability of program-proving techniques to the verification of operating systems, control programs and synchronization programs. All the illustrative examples to be presented use Dijkstra's P and V operations for controlling the synchronization of competing processes. However, the techniques discussed are applicable to any set of such control primitives. A major portion of the paper is devoted to the proof of correctness of two programs devised by Courtois et al. that control the sequencing of "readers" and "writers" requesting the use of a common device.