Proving fairness of schedulers
Considering explicit schedulers of nondeterministic programs, we propose a notion of cycles in infinite choice sequences and characterize fair sequences as being composed of cycles. We demonstrate that proof of fairness reduces to showing the existence of such cycles. Guarded commands are used to represent the scheduled actions and a proof technique is presented to discover conspiracies among them.
KeywordsProof System Total Correctness Proof Rule Cyclic Sequence Choice Sequence
Unable to display preview. Download preview PDF.
- K R Apt: Ten years of Hoare's logic: a survey — Part I, ACM TOPLAS 3 (4) (Oct 1981) 431–483.Google Scholar
- K R Apt: Ten years of Hoare logic: a survey — Part II: Nondeterminism, TCS 28 (1/2) (1984) 83–109.Google Scholar
- K R Apt, E-R Olderog: Proof rules and transformations dealing with fairness, SCP 3 (1) (1983) 65–100.Google Scholar
- K R Apt, A Pneuli, J Stavi: Fair termination revisited — with delay, TCS 33 (1) (1984) 65–84.Google Scholar
- E Best: Fairness and conspiracy, IPL 18 (4) (1984) 215–220; Erratum, IPL 19 (3) (1984) 162.Google Scholar
- O Grumberg, N Francez, J A Makowsky, W P de Roever: A proof rule for fair termination of guarded commands, Proc. Intl. Symp. Algorithmic languages (North-Holland, 1981) 339–416.Google Scholar
- D Harel: First-order dynamic logic, LNCS 68 (Springer, 1979).Google Scholar
- D Lehmann, A Pnueli, J Stavi: Impartiality, justice and fairness: the ethics of concurrent termination, Proc. 8th ICALP, Akko, LNCS 115 (Springer, 1981) 246–277.Google Scholar
- D Lehmann, M O Rabin: On the advantages of free choice: a fully distributed symmetric solution to the dining philosophers' problem, Proc. 8th POPL, Williamsburg (ACM, 1981).Google Scholar
- S Mahadevan, R K Shyamasundar: On the fairness of distributed programs, Proc. 2nd FST&TCS, Bangalore, (NCSDCT, TIFR, 1982) 171–191.Google Scholar