Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL
2013 (English)In: Interactive Theorem Proving: ITP 2013, Springer Berlin/Heidelberg, 2013, 197-212 p.Conference paper (Refereed)
Schematic Kleene algebra with tests (SKAT) supports the equational verification of flowchart scheme equivalence and captures simple while-programs with assignment statements. We formalise SKAT in Isabelle/HOL, using the quotient type package to reason equationally in this algebra. We apply this formalisation to a complex flowchart transformation proof from the literature. We extend SKAT with assertion statements and derive the inference rules of Hoare logic. We apply this extension in simple program verification examples and the derivation of additional Hoare-style rules. This shows that algebra can provide an abstract semantic layer from which different program analysis and verification tasks can be implemented in a simple lightweight way.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2013. 197-212 p.
, Lecture Notes in Computer Science, 7998
IdentifiersURN: urn:nbn:se:uu:diva-207378DOI: 10.1007/978-3-642-39634-2_16ISBN: 978-3-642-39633-5OAI: oai:DiVA.org:uu-207378DiVA: diva2:647919
4th International Conference on Interactive Theorem Proving (ITP); Rennes, France; July 22-26, 2013