Proof rules and transformations dealing with fairness
- 30 April 1983
- journal article
- research article
- Published by Elsevier in Science of Computer Programming
- Vol. 3 (1), 65-100
- https://doi.org/10.1016/0167-6423(83)90004-7
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Countable nondeterminism and random assignmentJournal of the ACM, 1986
- A proof rule for fair termination of guarded commandsInformation and Control, 1985
- The Total Correctness of Parallel ProgramsSIAM Journal on Computing, 1981
- Impartiality, justice and fairness: The ethics of concurrent terminationLecture Notes in Computer Science, 1981
- The temporal semantics of concurrent programsTheoretical Computer Science, 1981
- Characterizing correctness properties of parallel programs using fixpointsLecture Notes in Computer Science, 1980
- Nondeterminism and the Correctness of Parallel Programs.Published by Defense Technical Information Center (DTIC) ,1977
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967