A closer look at termination
From MaRDI portal
Publication:1216947
DOI10.1007/BF00264565zbMath0304.68025MaRDI QIDQ1216947
Publication date: 1975
Published in: Acta Informatica (Search for Journal in Brave)
Related Items (4)
On proving the termination of algorithms by machine ⋮ On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics ⋮ Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic ⋮ Semantics of algorithmic languages
This page was built for publication: A closer look at termination
