Turing und die Verifikation

Fifty years of Hoare’s logic

“…We present here in Figure 6 a proof outline for a while program corresponding to Turing's example given in Figure 3 of Subsection 2.1. The program without the assertions was shown in [OW12]. The qualification inv is used to annotate the loop invariants and bd to annotate the termination functions.…”