OnHoareLogicandKleeneAlgebrawithTests-Cornell.PDFVIP

On Hoare Logic and Kleene Algeb ra with Tests Dexter Kozen Cornell University We show that Kleene algebra with tests KAT subsumes prop ositional Hoare logic PHL Thus the sp ecialized syntax and deductive apparatus of Hoare logic are inessential and can b e 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 PSPA CEcomplete Categories and Sub ject Descriptors D Software Engineering To ols and Techniques structured pr ogramming D Software Engineering Program Verication correctness pr oofs D Software Engineering Language Constructs and Features control structures F Logics and Meanings of Programs Sp ecifying and Verifying and Reasoning ab out Programs assertions invariants logics of programs mechanical verication pr e and postcon ditions specication techniques F Logics and Meanings of Programs Semantics of Programming Languages algebraic approaches to semantics F Logics and Meanings of Programs Studies of Program Constructs control primitives I Algebraic Manipula tion Expressions and Their Representations simplication of expressions I Algebraic Manipulation Languages and Systems specialpurpose algebraic systems I Algebraic Manipulation Automatic Programmingpr ogram modication pr ogram synthesis pr ogram transformation pr ogram verication General Terms Design Languages Theory Verication Additional Key Words and Phrases Dynamic logic Hoare logic Kleene algebra Kleene algebra with tests sp ecication INTRODUCTION Ho are logic introduced by C A R Hoare in Hoare was the rst for mal systemfor the specication and vericationof wellstructuredprograms This pioneering