Answers are grounded in this paper and cite their sources.
This paper illustrates a method of constructing a program together with its proof. By structuring the program at two levels of abstraction, the proof of the more abstract algorithm may be completely separated from the proof of the concrete representation. In this way, the overall complexity of the proof is kept within more reasonable bounds.
No takes yet. Share an insight, caveat, or question.
C. A. R. Hoare (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: