scientific article; zbMATH DE number 3924132

From MaRDI portal
Publication:3698302





[For the entire collection see Zbl 0562.00009.] This paper is concerned with the analysis of program verification methods which \textit{I. Németi} [Lect. Notes Comput. Sci. 131, 311-348 (1982; Zbl 0493.68032)] deals with. The author finds direct characterizations of the program verifying powers by Burstall's and Pnueli's methods in terms of classical first order logic both within and without the framework suggested by Németi [loc. cit.]. He compares further the program verifying powers of the various methods and solves some problems raised by Németi [loc. cit.] concerning the lattice of program verification methods.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698302)