scientific article; zbMATH DE number 3924132
[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.
- Application of modal logics to the specification and verification of programs
- scientific article; zbMATH DE number 3982508
- Non-standard algorithmic and dynamic logic
- Is ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs?
- Does “N+1 times” prove more programs correct than “N times”?
- The power of temporal proofs
- Weak second order characterizations of various program verification systems
- Temporal logics need their clocks
- Recursive programs and denotational semantics in absolute logics of programs
- Application of modal logics to the specification and verification of programs
- scientific article; zbMATH DE number 3982508 (Why is no real title available?)
- Total correctness in nonstandard logics of programs
- Does “N+1 times” prove more programs correct than “N times”?
- A simple proof for the completeness of Floyd's method
- On the strength of temporal proofs
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)