Fair termination revisited - with delay

DOI10.1016/0304-3975(84)90103-8zbMath0542.68015OpenAlexW2143417417MaRDI QIDQ795499

Amir Pnueli, Jonathan Stavi, Krzysztof R. Apt

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90103-8

zbMATH Keywords

concurrent programstotal correctnessnondeterministic programsfair terminationproof method

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items

A complete rule for equifair termination, Deadlock and fairness in morphisms of transition systems, Infinite trees, markings, and well-foundedness, A methodology for designing proof rules for fair parallel programs, The \(\mu\)-calculus as an assertion-language for fairness arguments, Liminf progress measures, Complete proof rules for strong fairness and strong extreme fairness, Communicating processes, scheduling, and the complexity of nontermination, Verification of concurrent programs: The automata-theoretic framework, Fifty years of Hoare's logic

Cites Work

• Proof rules and transformations dealing with fairness
• An axiomatic proof technique for parallel programs
• Axiomatic approach to total correctness of programs
• Programming as a Discipline of Mathematical Nature
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item