ACM Transactions on Computational Logic · 2000 · 150 citations · 12 references
HumanitiesComputer ScienceMathematicsAlgebraLogicSyntaxAutomated ReasoningDeductive ReasoningHoare LogicMathematical LogicModel TheoryPropositional LogicAutomated Theorem Proving In AlgebraEquational LogicEquational ReasoningKleene LogicSyntax Of Propositional Logic
We show 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. In addition, we show that all relationally valid inference rules are derivable in KAT and that deciding the relational validity of such rules is PSPACE -complete.
12
An axiomatic basis for computer programming
C. A. R. Hoare · Communications of the ACM · 1969 · 3.9K citations · Full text
Dexter Kozen · ACM Transactions on Programming Languages and Systems · 1997 · 522 citations · Full text