Program analysis and verification based on Kleene algebra in Isabelle/HOL
From MaRDI portal
Recommendations
Cited in
(13)- Calculational verification of reactive programs with reactive relations and Kleene algebra
- Modal Kleene algebra applied to program correctness
- Solving quantifier-free first-order constraints over finite sets and binary relations
- A verified compiler from Isabelle/HOL to CakeML
- Unifying heterogeneous state-spaces with lenses
- Hoare semigroups
- Stone relation algebras
- Mathematics of Program Construction
- Algebras for program correctness in Isabelle/HOL
- An Axiomatization of Arrays for Kleene Algebra with Tests
- Logic for Programming, Artificial Intelligence, and Reasoning
- Building program construction and verification tools from algebraic principles
- Describing data flow analysis techniques with Kleene algebra
This page was built for publication: Program analysis and verification based on Kleene algebra in Isabelle/HOL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5327345)