Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL

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.

Struth, Georg (författare)
Weber, TjarkUppsala universitet,Datalogi,Mobility(Swepub:uu)tjawe125 (författare)
Uppsala universitetDatalogi (creator_code:org_t)

Ingår i:Interactive Theorem ProvingBerlin, Heidelberg : Springer Berlin/Heidelberg, s. 197-2129783642396335

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.