Answers are grounded in this paper and cite their sources.
A theory of commands with weakest precondition semantics is formalised using the HOL proof assistant system. The concept of refinement between commands is formalised, a number of refinement rules are proved and it is shown how the formalisation can be used for proving refinements of actual program texts correct.
No takes yet. Share an insight, caveat, or question.
Back et al. (1990) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: