On Hoare Logic, Kleene Algebra, and Types
Year: 1999
Type: report
Abstract: We show that propositional Hoare logic is subsumed by the type calculus of typed Kleene algebra augmented with subtypes and typecasting. Assertions are interpreted as typecast operators. Thus Hoare-style reasoning with partial correctness assertions reduces to typechecking in this system. 1 Introduction In previous work [18, 19], we have shown that Kleene algebra with tests (KAT) subsumes propositional Hoare logic (PHL). Thus the specialized syntax and deductive apparatus of Hoare logic are inessential and can be replaced by simple equational reasoning. We have also shown that KAT provides a complete deductive system for Hoare-style inference rules involving partial correctness assertions and that PHL is PSPACE-complete. In other recent work [17], we have introduced a simple and natural type system for Kleene algebra (KA) in which objects have types s ! t. The use of types was motivated by the desire to handle nonsquare matrices, although there are other useful interpretations. In t...
Source: eCommons (Cornell University)
Author: Dexter Kozen
Institution: Cornell University
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W1557727575
