| Proving Liveness Properties of Concurrent Programs |
| Full text |
Pdf
(2.13 MB)
|
| Source
|
ACM Transactions on Programming Languages and Systems (TOPLAS)
archive
Volume 4 , Issue 3 (July 1982)
table of contents
Pages: 455 - 495
Year of Publication: 1982
ISSN:0164-0925
|
|
Authors
|
|
Susan Owicki
|
Computer Systems Laboratory, Stanford Electronics Laboratories, Department of Electrical Engineering, Stanford University, Stanford, CA
|
|
Leslie Lamport
|
Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CA
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 91, Citation Count: 97
|
|
|
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
|
BURSTALL, R.M. Program proving as hand simulation with a little induction. In Information Processing 74, Stockholm, 1974, pp. 308-312.
|
 |
2
|
|
| |
3
|
FLON, L., AND SUZUKI, N. The total correctness of parallel programs. SIAM J. Comput. 10, 2 (May 1981), 227-246.
|
| |
4
|
FRANCEZ, N., AND PNUELI, A. A proof method for cyclic programs. Acta inf. 9, 2 (1978), 133- 158.
|
 |
5
|
|
| |
6
|
HAREL, D., KOZEN, D., AND PARIKH, R. Process logic: Expressiveness, decidability, completeness. In Proceedings of the 21st Symposium on the Foundations of Computer Science, IEEE, Syracuse, N.Y., Oct. 1980, pp. 129-142.
|
 |
7
|
|
| |
8
|
|
| |
9
|
LAMPORT, L. The "Hoare logic" of concurrent programs. Acta Inf. 14, I (1980), 21-37.
|
 |
10
|
|
| |
11
|
LAMPORT, L. Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. SE- 3, 2 (Mar. 1977), 125-143.
|
| |
12
|
|
 |
13
|
|
| |
14
|
OWlCKX, S., AND GRIt. S, D. An axiomatic proof technique for parallel programs. Acta Inf. 6, 4 (1976), 319-340.
|
| |
15
|
|
| |
16
|
PNVr. LI, A. The temporal logic of programs. In Proceedings of the 18th Symposium on the Foundations of Computer Science, IEEE, Providence, Nov. 1977, pp. 46-57.
|
 |
17
|
|
| |
18
|
PRATT, V.R. Semantical considerations on Floyd-Hoare logic. In 17th Symposium on Foundations of Computer Science, IEEE, Houston, Tex., Oct. 1976, pp. 109-121.
|
CITED BY 97
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Matthew B. Dwyer , George S. Avrunin , James C. Corbett, Patterns in property specifications for finite-state verification, Proceedings of the 21st international conference on Software engineering, p.411-420, May 16-22, 1999, Los Angeles, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
E. A. Emerson , T. Sadler , J. Srinivasan, Efficient temporal reasoning (extended abstract), Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.166-178, January 11-13, 1989, Austin, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Zohar Manna , Amir Pnueli, A hierarchy of temporal properties (invited paper, 1989), Proceedings of the ninth annual ACM symposium on Principles of distributed computing, p.377-410, August 22-24, 1990, Quebec City, Quebec, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Tom Henzinger , Zohar Manna , Amir Pnueli, Temporal proof methodologies for real-time systems, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.353-366, January 21-23, 1991, Orlando, Florida, United States
|
|
|
|
|
|
|
|
|
|
|
|
Cristina Videira Lopes , Paul Dourish , David H. Lorenz , Karl Lieberherr, Beyond AOP: toward naturalistic programming, Companion of the 18th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, October 26-30, 2003, Anaheim, CA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
D. E. Shasha , A. Pnueli , W. Ewald, Temporal verification of carrier-sense local area network protocols, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.54-65, January 15-18, 1984, Salt Lake City, Utah, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Arun Kejariwal , Hideki Saito , Xinmin Tian , Milind Girkar , Wel Li , Utpal Banerjee , Alexandru Nicolau , Constantine D. Polychronopoulos, Lightweight lock-free synchronization methods for multithreading, Proceedings of the 20th annual international conference on Supercomputing, June 28-July 01, 2006, Cairns, Queensland, Australia
|
|
|
|
|
|
|
|
|
|
|
|
Van Nguyen , David Gries , Susan Owicki, A model and temporal proof system for networks of processes, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.121-131, January 14-16, 1985, New Orleans, Louisiana, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|