Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
The ``Hoare Logic'' of CSP, and All That
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal verification of parallel programs
Communications of the ACM
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
First-Order Dynamic Logic
The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
A simple approach to specifying concurrent systems
Communications of the ACM
win and sin: predicate transformers for concurrency
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lamport on mutual exclusion: 27 years of planting seeds
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
| Hi-index | 0.02 |
A method is presented that permits assertional reasoning about a concurrent program even though the atomicity of the elementary operations is left unspecified. It is based upon a generalization of the dynamic logic operator [α]. The method is illustrated by verifying the mutual exclusion property for a two-process version of the bakery algorithm.