Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time

Abstract

Guarded Kleene Algebra with Tests (GKAT) is a variation on Kleene Algebra with Tests (KAT) that arises by restricting the union ($+$) and iteration ($\ast$) operations from KAT to predicate-guarded versions. We develop the (co)algebraic theory of GKAT and show how it can be efficiently used to reason about imperative programs. In contrast to KAT, whose equational theory is PSPACE-complete, we show that the equational theory of GKAT is (almost) linear time. We also provide a full Kleene theorem and prove completeness for an analogue of Salomaa's axiomatization of Kleene Algebra.

arXiv commentExtended version with appendix

References in corpus (1)

• Scalable Verification of Probabilistic Networks

Cited by in corpus (9)

• Algebraic Reasoning of Quantum Programs via Non-idempotent Kleene Algebra
• KATch: A Fast Symbolic Verifier for NetKAT
• Kleene Algebra Modulo Theories
• Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks
• On Star Expressions and Coalgebraic Completeness Theorems
• Concurrent Kleene Algebra with Observations: from Hypotheses to Completeness
• Algebras for Deterministic Computation Are Inherently Incomplete
• CF-GKAT: Efficient Validation of Control-Flow Transformations
• Combining Semilattices and Semimodules