scientific article; zbMATH DE number 3650541

MaRDI QIDQ3208642zbMATH OpenFDO

Authors István Németi, Ildikó Sain, Hajnal Andréka

Publication date 1979

zbMATH Keywords

complete rules for program verificationcompletenessfirst order dynamic logicinference systemslogic of actionsmodel-theoretic semanticsPresburger arithmeticsemantics of program schemes

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Nonclassical models (Boolean-valued, sheaf, etc.) (03C90) Abstract model theory (03C95) Nonstandard models of arithmetic (03H15) General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Cited in

(6)

• Non-standard algorithmic and dynamic logic
• A complete logic for reasoning about programs via nonstandard model theory. I
• A complete logic for reasoning about programs via nonstandard model theory. II
• Temporal logics need their clocks
• Recursive programs and denotational semantics in absolute logics of programs
• 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 Q3208642)