Progress measures and stack assertions for fair termination

DOI10.1145/135419.135462MaRDI QIDQ5348854zbMATH OpenOpenAlexFDO

Authors Nils Klarlund

Publication date 21 August 2017

Published in Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/135419.135462

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Fair termination for parameterized probabilistic concurrent systems
• A proof rule for fair termination of guarded commands
• Probabilistic termination versus fair termination
• Program refinement in fair transition systems
• Transition predicate abstraction and fair termination

Cited in

(6)

• The \(\mu\)-calculus as an assertion-language for fairness arguments
• Progress measures, immediate determinacy, and a subset construction for tree automata
• Automatically disproving fair termination of higher-order functional programs
• Automata theory and model checking
• scientific article; zbMATH DE number 3846836 (Why is no real title available?)
• Liminf progress measures

This page was built for publication: Progress measures and stack assertions for fair termination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348854)