Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
A language for formal problem specification
Communications of the ACM
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Concurrent control with “readers” and “writers”
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Verifying Concurrent Processes Using Temporal Logic
Verifying Concurrent Processes Using Temporal Logic
Formal specification as a design tool
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interval logic for higher-level temporal reasoning
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
GEM: A tool for concurrency specification and verification
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Interleaving set temporal logic
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A simple approach to specifying concurrent systems
Communications of the ACM
A Relational Notation for State Transition Systems
IEEE Transactions on Software Engineering
A stepwise refinement heuristic for protocol construction
ACM Transactions on Programming Languages and Systems (TOPLAS)
A bounded first-in, first-enabled solution to the l-exclusion problem
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
Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Specifying modules to satisfy interfaces: a state transition system approach
Distributed Computing - Special issue: Specification of concurrent systems
A generalisation of a relational structures model of concurrency
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
On Causality Semantics of Nets with Priorities
Fundamenta Informaticae
| Hi-index | 0.02 |
The formal correspondence between an implementation and its specification is examined. It is shown that existing specifications that claim to describe priority are either vacuous or else too restrictive to be implemented in some reasonable situations. This is illustrated with a precisely formulated problem of specifying a first-come-first-served mutual exclusion algorithm, which it is claimed cannot be solved by existing methods.