research-article

Free access

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

Author:

Karl N. LevittAuthors Info & Claims

AFIPS '72 (Fall, part I): Proceedings of the December 5-7, 1972, fall joint computer conference, part I

Pages 33 - 47

https://doi.org/10.1145/1479992.1479997

Published: 05 December 1972 Publication History

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.

References

[1]

E W Dijkstra The structure of THE multiprogramming system Comm ACM 11 5 pp 341--346 May 1968

Digital Library

[2]

P J Courtois F Heymans D L Parnass Concurrent control with "READERS" and WRITERS" Comm ACM 14 10 pp 667--668 October 1971

Digital Library

[3]

R W Floyd Assigning meanings to programs In Mathematical Aspects of Computer Science J T Schwartz (ed) Vol 19 Am Math Soc pp 19--32 Providence Rhode Island 1967

[4]

P Naur Proof of algorithms by general snapshots BIT 6 4 pp 310--316 1966

[5]

Z Manna The correctness of programs J Computer and System Sciences 3 2 pp 119--127 May 1969

Digital Library

[6]

R L London Computer programs can be proved correct In Proc 4th Systems Symposium---Formal Systems and Nonnumerical Problem Solving by Computer R B Banerji and M D Mesarovic (eds) pp 281--302 Springer Verlag New York 1970

[7]

R L London Proof of algorithms, a new kind of certification (Certification of Algorithm 245, TREESORT S) Comm ACM 13 6 pp 371--373 June 1970

Digital Library

[8]

R L London Correctness of two compilers for a LISP subset Stanford Artificial Intelligence Project AIM-151 Stanford California October 1971

[9]

B Elspas K N Levitt R J Waldinger A Waksman An assessment of techniques for proving program correctness ACM Computing Surveys 4 2 pp 97--147 June 1972

Digital Library

[10]

E Ashcroft Z Manna Formalization of properties of parallel programs Stanford Artificial Intelligence Project AIM-110 Stanford California February 1970

[11]

A N Habermann Synchronization of communicating processes Comm ACM 15 3 pp 177--184 March 1970

Digital Library

[12]

J C King A program verifier PhD Thesis Carnegie-Mellon University Pittsburgh Pennsylvania 1969

Digital Library

[13]

D I Good Toward a man-machine system for proving program correctness PhD Thesis University of Wisconsin Madison Wisconsin 1970

Digital Library

[14]

B Elspas M W Green K N Levitt R J Waldinger Research in interactive program-proving technique Stanford Research Institute Menlo Park California May 1972

[15]

S Patil Limitations and capabilities of Dijkstra's semaphore primitives for coordination among processes MIT Project MAC Cambridge Massachusetts February 1971

[16]

R L London The current status of proving programs correct Proc 1972 ACM Conference pp 39--46 August 1972

Digital Library

[17]

R C Holt Comments on the prevention of system deadlocks Comm ACM 14 1 pp 36--38 January 1971

Digital Library

Cited By

Schneider FAndrews G(2005)Concepts for concurrent programmingCurrent Trends in Concurrency10.1007/BFb0027049(669-716)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0027049
Silberschatz AAusting RConti DEngel G(1978)Serializability in multi-level monitor environmentsProceedings of the 1978 annual conference - Volume 210.1145/800178.810154(855-861)Online publication date: 1-Jan-1978
https://dl.acm.org/doi/10.1145/800178.810154
Lamport L(1977)Proving the Correctness of Multiprocess ProgramsIEEE Transactions on Software Engineering10.1109/TSE.1977.2299043:2(125-143)Online publication date: 1-Mar-1977
https://dl.acm.org/doi/10.1109/TSE.1977.229904
Show More Cited By

Recommendations

Formal Verification of Fault Tolerance Using Theorem-Proving Techniques

A formal verification system based on the use of automated reasoning techniques is described to validate fault tolerance. An extended Petri net representation, called a flow net, is described together with the theorem-proving implementation of a rule-...
An abstraction refinement approach combining precise and approximated techniques for efficient program verification: abstract for the invited talk
SAVCBS '09: Proceedings of the 8th international workshop on Specification and verification of component-based systems

Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to the predicates. Given ...
Program proving using intermediate verification languages (IVLs) like boogie and why3
HILT '12

A program verifier is a complex piece of software. To deal with this complexity, a standard architecture of a modern program verifier consists of two basic parts: a front end and a back end, separated by an intermediate verification language (IVL). The ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

AFIPS '72 (Fall, part I): Proceedings of the December 5-7, 1972, fall joint computer conference, part I

December 1972

666 pages

ISBN:9781450379120

DOI:10.1145/1479992

Copyright © 1972 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

AFIPS: American Federation of Information Processing Societies

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 December 1972

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
196
Total Downloads

Downloads (Last 12 months)53
Downloads (Last 6 weeks)5

Reflects downloads up to 10 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Schneider FAndrews G(2005)Concepts for concurrent programmingCurrent Trends in Concurrency10.1007/BFb0027049(669-716)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0027049
Silberschatz AAusting RConti DEngel G(1978)Serializability in multi-level monitor environmentsProceedings of the 1978 annual conference - Volume 210.1145/800178.810154(855-861)Online publication date: 1-Jan-1978
https://dl.acm.org/doi/10.1145/800178.810154
Lamport L(1977)Proving the Correctness of Multiprocess ProgramsIEEE Transactions on Software Engineering10.1109/TSE.1977.2299043:2(125-143)Online publication date: 1-Mar-1977
https://dl.acm.org/doi/10.1109/TSE.1977.229904
Keller R(1976)Formal verification of parallel programsCommunications of the ACM10.1145/360248.36025119:7(371-384)Online publication date: 1-Jul-1976
https://dl.acm.org/doi/10.1145/360248.360251
Sintzoff MLamsweerde AShooman MYeh R(1975)Constructing correct and efficient concurrent programsProceedings of the international conference on Reliable software10.1145/800027.808454(319-326)Online publication date: 1-Apr-1975
https://dl.acm.org/doi/10.1145/800027.808454
Sintzoff MLamsweerde A(1975)Constructing correct and efficient concurrent programsACM SIGPLAN Notices10.1145/390016.80845410:6(319-326)Online publication date: 1-Apr-1975
https://dl.acm.org/doi/10.1145/390016.808454
Lipton R(1975)ReductionCommunications of the ACM10.1145/361227.36123418:12(717-721)Online publication date: 1-Dec-1975
https://dl.acm.org/doi/10.1145/361227.361234
Griffiths PBrown RGlaze D(1974)SYNVERProceedings of the 1974 annual conference - Volume 110.1145/800182.810398(167-173)Online publication date: 1-Jan-1974
https://dl.acm.org/doi/10.1145/800182.810398

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents