Answers are grounded in this paper and cite their sources.
Following the fixpoint theory of Scott, the semantics of computer programs are defined in terms of the least fixpoints of recursive programs. This allows not only the justification of all existing verification techniques, but also their extension to the handling, in a uniform manner of various properties of computer programs, including correctness, termination, and equivalence.
No takes yet. Share an insight, caveat, or question.
Manna et al. (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: