Logics of Programs

Volume 131 of the series Lecture Notes in Computer Science pp 1-8


Proof rules dealing with fairness

Extended abstract
  • Krzysztof R. AptAffiliated withFaculty of Economics, University of Rotterdam
  • , Ernst-Rüdiger OlderogAffiliated withInstitut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel

* Final gross prices may vary according to local VAT.

Get Access


We provide proof rules allowing to deal with two fairness assumptions in the context of Dijkstra's do-od programs. These proof rules are obtained by considering a translated version of the original program which uses random assignment x:=? and admits only fair runs. The proof rules use infinite ordinals and deal with the original programs and not their translated versions.