scientific article; zbMATH DE number 3632451

MaRDI QIDQ4193440zbMATH OpenFDO

Authors István Németi, Hajnal Andréka

Publication date 1978

zbMATH Keywords

Completeness of Floyd LogicFloyd- Provable ProgramsFormal SystemProgramming Theory

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Categoricity and completeness of theories (03C35) General topics in the theory of software (68N01) Abstract data types; algebraic specification (68Q65)

Cited in

(8)

• Non-standard algorithmic and dynamic logic
• Weak second order characterizations of various program verification systems
• A complete logic for reasoning about programs via nonstandard model theory. II
• Programs and program verifications in a general setting
• Recursive programs and denotational semantics in absolute logics of programs
• The axiomatic semantics of programs based on Hoare's logic
• 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 Q4193440)