Complete assertional proof rules for progress under weak and strong fairnessHesselink, W. H., 1-Sep-2013, In : Science of computer programming. 78, 9, p. 1521-1537 17 p.
Research output: Contribution to journal › Article › Academic › peer-review
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 P operations. (C) 2012 Elsevier B.V. All rights reserved.
|Number of pages||17|
|Journal||Science of computer programming|
|Publication status||Published - 1-Sep-2013|
- UNITY, Temporal logic, Weak fairness, Strong fairness, Proof rules, UNITY LOGIC, PROGRAMS, DERIVATION, REFINEMENT, SYSTEM