Parallel program design: a foundation
Parallel program design: a foundation
Loosely-coupled processes (preliminary version)
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume II: parallel languages: volume II: parallel languages
A simple proof of a completeness result for leads-to in the UNITY logic
Information Processing Letters
Modular progress proofs of asynchronous programs
Modular progress proofs of asynchronous programs
The notions of consistency and predicate locks in a database system
Communications of the ACM
Reduction: a method of proving properties of parallel programs
Communications of the ACM
A discipline of multiprogramming: programming theory for distributed applications
A discipline of multiprogramming: programming theory for distributed applications
Extensions of the Unity Methodology: Compositionality, Fairness and Probability in Parallelism
Extensions of the Unity Methodology: Compositionality, Fairness and Probability in Parallelism
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Stubborn sets for reduced state space generation
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Immediacy: a technique for reasoning about asynchrony
Immediacy: a technique for reasoning about asynchrony
Verification of distributed programs using representative interleaving sequences
Distributed Computing
Science of Computer Programming
| Hi-index | 0.00 |
We propose weakening the definition of progress to a branching-time operator, making it more amenable to compositional proof and simplifying the predicates needed to reason about highly asynchronous programs. The new progress operator ("achieves") coincides with the "leads-to" operator on all "observable" progress properties (those where the target predicate is stable) and satisfies the same composition properties as leads-to, including the PSP theorem. The advantage of achievement lies in its compositionality: a program inherits all achievement properties of its "decoupled components". (For example, a dataflow network inherits achievement properties from each of its processes.) The compositionality of achievement captures, in a UNITY-like logic, the well-known operational trick of reasoning about an asynchronous program by considering only certain well-behaved executions.