Complete assertional proof rules for progress under weak and strong fairness

The UNITY rules for leads-to, based on totality of the commands and weak fairness, are generalized to specifications with nontotal commands and impartiality. The rules and the corresponding predicate transformers are proved to be sound and complete by elementary means. These results are subsequently extended to specifications where the liveness property also contains a finite number of strong fairness assumptions. This is illustrated by means of a proof of starvation freedom for the standard implementation of mutual exclusion by plain semaphores, with strong fairness for the PP operations.

► Soundness and completeness of the proof rules of UNITY.
► These proof rules express weak fairness.
► Generalization of this to infinitely many nondeterministic commands.
► Extension of this to allow finitely many strongly fair commands.
► Mutual exclusion with strongly fair plain semaphores is starvation free.