Parallel program design: a foundation
Parallel program design: a foundation
A predicate transformer approach to semantics of parallel programs
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Information Processing Letters
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Peterson's mutual exclusion algorithm revisited
Science of Computer Programming
On a method of multiprogramming
On a method of multiprogramming
A Discipline of Programming
Concurrent program design in the extended theory of Owicki and Gries
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Constructing and Reasoning About Security Protocols Using Invariants
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about inherent parallelism in modern object-oriented languages
ACSC '08 Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
Calculating and composing progress properties in terms of the leads-to relation
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Verifying lock-freedom using well-founded orders
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Assertion-based proof checking of chang-roberts leader election in PVS
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Compositional action system derivation using enforced properties
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Formalising progress properties of non-blocking programs
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Hi-index | 0.00 |
We present some techniques to obtain smooth derivations of concurrent programs that address both safety and progress in a formal manner. Our techniques form an extension to the calculational method of Feijen and van Gasteren using a UNITY style progress logic. We stress the role of stable guards, and we illustrate the derivation techniques on some examples in which progress plays an essential role.