scientific article
From MaRDI portal
Publication:3939224
zbMath0481.68035MaRDI QIDQ3939224
Ildikó Sain, Istvan Németi, Hajnalka Andréka
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
program verificationcontinuous tracecompleteness theorem for Floyd-Hoare logicnonstandard recursion theory
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Related Items (7)
Non-standard algorithmic and dynamic logic ⋮ Recursive programs and denotational semantics in absolute logics of programs ⋮ A complete logic for reasoning about programs via nonstandard model theory. I ⋮ A complete logic for reasoning about programs via nonstandard model theory. II ⋮ Total correctness in nonstandard logics of programs ⋮ Hoare's logic for nondeterministic regular programs: A nonstandard approach ⋮ The axiomatic semantics of programs based on Hoare's logic
This page was built for publication:
