A completeness theorem for dynamic logic (Q760793): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1305/ndjfl/1093870760 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001982768 / rank | |||
Normal rank | |||
Latest revision as of 01:35, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A completeness theorem for dynamic logic |
scientific article |
Statements
A completeness theorem for dynamic logic (English)
0 references
1985
0 references
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.
0 references
Floyd-Hoare method
0 references
inductive assertions
0 references
partial correctness
0 references
