| Control predicates are better than dummy variables for reasoning about program control |
| Full text |
Pdf
(1.12 MB)
|
| Source
|
ACM Transactions on Programming Languages and Systems (TOPLAS)
archive
Volume 10 , Issue 2 (April 1988)
table of contents
Pages: 267 - 281
Year of Publication: 1988
ISSN:0164-0925
|
|
Author
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 43, Citation Count: 4
|
|
|
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
ASHCROFT, E. Proving assertions about parallel programs. J. Comput. $ystm. $ci. 10 (Jan. 1975), 110-135.
|
| |
2
|
DIJKSTRA, E. W. Misra's proof for Lamport's mutual exclusion. Nov. 1985. EWD948.
|
| |
3
|
FLOYD, R. W. Assigning meanings to programs. In Proceedings of the Symposium on Applied Math., Vol. 19 (1967), American Mathematical Society, pp. 19-32.
|
 |
4
|
|
| |
5
|
|
| |
6
|
LAMPORT, L. A fast mutual exclusion algorithm. 1985. Submitted for publication.
|
| |
7
|
LAMPORT, L. The 'Hoare logic' of concurrent programs. Acta Inf. ld, i (1980), 21-37.
|
| |
8
|
LAMPORT, L. Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. SE-3, 2 (March 1977), 125-143.
|
 |
9
|
|
 |
10
|
|
| |
11
|
OWICKI, S., AND GRIES, D. An axiomatic proof technique for parallel programs. Acta Inf. 6, 4 (1976), 319-340.
|
| |
12
|
|
REVIEW
"Nissim Francez : Reviewer"
The paper presents a reformulation of the Owicki-Gries proof method for
partial correctness assertions about shared variables concurrent programs.
The reformulation consists of replacing the appeal to dummy (auxiliary,
ghost) variables by an exp
more...
|