A completeness theorem for dynamic logic (Q760793)

The celebrated method of \textit{R. W. Floyd} [Proc. Symp. Appl. Math. 19, 19-32 (1967; Zbl 0189.502)] and \textit{C. A. R. Hoare} [Commun. ACM 12, 576-580 (1969; Zbl 0179.231)] makes use of inductive assertions for proving partial correctness of programs. There are partially correct programs which fail to have adequate inductive assertions [see, e.g., \textit{H. Andréka}, \textit{I. Németi} and \textit{I. Sain}, Lect. Notes Comput. Sci. 118, 162-171 (1981; Zbl 0481.68035)], but this paper shows that this can be remedied by giving an alternative definition for the run of a program.