Floyd-Hoare logic in iteration theories

DOI10.1145/115234.115352zbMath0799.68042OpenAlexW2077478451MaRDI QIDQ4302858

Zoltán Ésik, Stephen L. Bloom

Publication date: 13 November 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/115234.115352

zbMATH Keywords

completenessequational logiciteration theorieslogic programmingHoare logiccorrectness assertionpartial correctness logic

Mathematics Subject Classification ID

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

Related Items

Matrix and matricial iteration theories. II, Equational axioms for regular sets, Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview, Program correctness and matricial iteration theories, Equational properties of fixed-point operations in cartesian categories: An overview, Semantic models for total correctness and fairness, A note on guarded theories, Equational theories for automata, Context-free series on trees, On the completeness of propositional Hoare logic, A Fully Equational Proof of Parikh's Theorem