Control predicates are better than dummy variables for reasoning about program control
Author:
Open Access
- 1 April 1988
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 10 (2) , 267-281
Abstract
When explicit control predicates rather than dummy variables are used, the Owicki-Gries method for proving safety properties of concurrent programs can be strengthened, making it easier to construct the required program annotations.Keywords
This publication has 10 references indexed in Scilit:
- A fast mutual exclusion algorithmACM Transactions on Computer Systems, 1987
- Constraints1985
- An Axiomatic Semantics of Concurrent Programming Languages1985
- The ``Hoare Logic'' of CSP, and All ThatACM Transactions on Programming Languages and Systems, 1984
- The ?Hoare logic? of concurrent programsActa Informatica, 1980
- Proving the Correctness of Multiprocess ProgramsIEEE Transactions on Software Engineering, 1977
- An axiomatic proof technique for parallel programs IActa Informatica, 1976
- Proving assertions about parallel programsJournal of Computer and System Sciences, 1975
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- Assigning meanings to programs1967