Progress measures and stack assertions for fair termination

DOI10.1145/135419.135462zbMath1370.68054OpenAlexW2072623190MaRDI QIDQ5348854

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)

Related Items

Progress measures, immediate determinacy, and a subset construction for tree automata ⋮ Automata Theory and Model Checking ⋮ Liminf progress measures