An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic
From MaRDI portal
Publication:910396
DOI10.1305/ndjfl/1093635239zbMath0696.03013OpenAlexW1972583224MaRDI QIDQ910396
Publication date: 1989
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1093635239
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Total correctness in nonstandard logics of programs ⋮ On the Completeness of Dynamic Logic ⋮ Inductive Completeness of Logics of Programs ⋮ On the strength of temporal proofs
