An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic

From MaRDI portal

Revision as of 17:01, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:910396

Jump to:navigation, search

DOI10.1305/ndjfl/1093635239zbMath0696.03013OpenAlexW1972583224MaRDI QIDQ910396

Ildikó Sain

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

zbMATH Keywords

semantics second-order logic Floyd-Hoare logic nondeterministic programs relational traces time-models

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

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

This page was built for publication: An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:910396&oldid=12875416"