Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time

@article{Smolka2020GuardedKA,
  title={Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time},
  author={S. Smolka and N. Foster and Justin Hsu and T. Kapp{\'e} and D. Kozen and A. Silva},
  journal={Proceedings of the ACM on Programming Languages},
  year={2020},
  volume={4},
  pages={1 - 28}
}
  • S. Smolka, N. Foster, +3 authors A. Silva
  • Published 2020
  • Computer Science, Mathematics
  • Proceedings of the ACM on Programming Languages
  • Guarded Kleene Algebra with Tests (GKAT) is a variation on Kleene Algebra with Tests (KAT) that arises by restricting the union (+) and iteration (*) 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… CONTINUE READING

    Figures and Topics from this paper

    References

    SHOWING 1-2 OF 2 REFERENCES
    Propositional Dynamic Logic of Regular Programs
    • 1,283
    • Highly Influential
    • PDF
    Analysis of Structured Programs
    • 76
    • Highly Influential