scientific article; zbMATH DE number 3924132

MaRDI QIDQ3698302zbMATH OpenFDO

Authors Ildikó Sain

Publication date 1985

zbMATH Keywords

nonstandard dynamic logicpartial correctnessprogram verifying powers

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Model theory (03C99) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• 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”?

Cited in

(10)

• 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)