Complete proof rules for strong fairness and strong extreme fairness

DOI10.1016/0304-3975(93)90185-VzbMath0785.68058OpenAlexW1964616955MaRDI QIDQ685427

Michael G. Main

Publication date: 20 April 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90185-v

zbMATH Keywords

completenesssoundnessprogram verificationfair terminationiterative guarded commandrepetitive statementsstrong fairness

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Detection of additional mass in rods: Experimental and numerical investigation

Cites Work

• Unnamed Item
• Fair termination revisited - with delay
• Proof rules and transformations dealing with fairness
• A proof rule for fair termination of guarded commands
• A Weaker Precondition for Loops
• Guarded commands, nondeterminacy and formal derivation of programs
• Programming as a Discipline of Mathematical Nature

This page was built for publication: Complete proof rules for strong fairness and strong extreme fairness