scientific article; zbMATH DE number 3632451

zbMath0407.03034MaRDI QIDQ4193440

Istvan Németi, Hajnalka Andréka

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Formal SystemProgramming TheoryCompleteness of Floyd LogicFloyd- Provable Programs

Mathematics Subject Classification ID

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

Related Items (8)

Non-standard algorithmic and dynamic logic ⋮ Recursive programs and denotational semantics in absolute logics of programs ⋮ 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 ⋮ 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: