Work

KAT and PHL in Coq

Year: 2008
Type: article
Abstract: In this article we describe an implementation of Kleene algebra with tests (KAT) in the Coq theorem prover. KAT is an equational system that has been successfully applied in program verification and, in particular, it subsumes the propositional Hoare logic (PHL). We also present an PHL encoding in KAT, by deriving its deduction rules as theorems of KAT. Some examples of simple program's formal correctness are given. This work is part of a study of the feasibility of using KAT in the automatic production of certificates in the context of (source-level) Proof-Carrying-Code (PCC). .
Language: English
Subfield: Software
Open Access status: diamond
OpenAlex ID: W1979782624
FWCI: 1.373
Cites: 31
Cited by: 7
Related to: 9