Appraising fairness in languages for distributed programming
- 1 December 1988
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 2 (4) , 226-241
- https://doi.org/10.1007/bf01872848
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A compositional approach to superimpositionPublished by Association for Computing Machinery (ACM) ,1988
- Two normal form theorems for CSP programsInformation Processing Letters, 1987
- A complete rule for equifair terminationJournal of Computer and System Sciences, 1986
- A proof rule for fair termination of guarded commandsInformation and Control, 1985
- A proof system for concurrent ADA programsScience of Computer Programming, 1984
- Fair termination of communicating processesPublished by Association for Computing Machinery (ACM) ,1984
- Proof rules and transformations dealing with fairnessScience of Computer Programming, 1983
- Decentralization of process nets with centralized controlPublished by Association for Computing Machinery (ACM) ,1983
- Communicating sequential processesCommunications of the ACM, 1978
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975