Proof rules and transformations dealing with fairness

Apt, 1982, Proof rules dealing with fairness (extended abstract), 131, 1 Apt, 1982, Countable nondeterminism and random assignment Apt, 1982, Fair termination revisited—with delay, Proc. 2nd Conference on Software Technology and Theoretical Computer Science, 146 Cousot, 1977, Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice Dijkstra, 1976 Emerson, 1980, Characterizing correctness properties of parallel programs using fixpoints, 85, 169 Fischer, 1982, Storage requirements for fair scheduling Flon, 1978, Nondeterminism and the correctness of parallel programs, 589 Flon, 1981, The total correctness of parallel programs, SIAM J. Comput., 10, 227, 10.1137/0210016 Floyd, 1967, Assigning meaning to programs, 19 Grümberg, 1981, A proof rule for fair termination of guarded commands, 339 Lehmann, 1981, Impartiality, justice and fairness: the ethics of concurrent termination, 115, 264 Park, 1981, A predicate transformer for weak fair iteration, Proc. IBM Symposium on Mathematical Foundation of Computer Science Pnueli, 1981, The temporal semantics of concurrent programs, Theoret. Comput. Sci., 13, 45, 10.1016/0304-3975(81)90110-9