scientific article
From MaRDI portal
Publication:3309036
zbMath0528.68007MaRDI QIDQ3309036
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
program verificationprogram schemesFloyd's methodnonstandard dynamic logicaxiomatizable class of modelsmany-sorted similarity typeproof concept
Other nonclassical logic (03B60) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Classical first-order logic (03B10) Complexity of computation (including implicit computational complexity) (03D15) Properties of classes of models (03C52)
Related Items
Non-standard algorithmic and dynamic logic ⋮ Does “N+1 times” prove more programs correct than “N times”? ⋮ Recursive programs and denotational semantics in absolute logics of programs ⋮ Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics ⋮ Total correctness in nonstandard logics of programs ⋮ A simple proof for the completeness of Floyd's method