Termination assertions for recursive programs: Completeness and axiomatic definability

DOI10.1016/S0019-9958(83)80053-9zbMath0537.68034OpenAlexW2037906582MaRDI QIDQ3323258

John C. Mitchell, Albert R. Meyer

Publication date: 1983

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(83)80053-9

zbMATH Keywords

completenessaxiom systemterminationsoundnessrecursive proceduresrecursive programglobal procedure calls

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Related Items (3)

Reasoning in Dynamic Logic about Program Termination ⋮ Inductive Completeness of Logics of Programs ⋮ Necessary and sufficient conditions for the universality of programming formalisms

This page was built for publication: Termination assertions for recursive programs: Completeness and axiomatic definability