4 papers
Partial Reductions for Kleene Algebra with Linear Hypotheses
Liam Chung, Tobias Kappé
Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivale…
Kleene Algebra
Tobias Kappé, Alexandra Silva, Jana Wagemaker
This booklet serves as an introduction to Kleene Algebra (KA), a set of laws that can be used to study general equivalences between programs. It discusses how general programs can…
On Propositional Program Equivalence (extended abstract)
Tobias Kappé
General program equivalence is undecidable. However, if we abstract away the semantics of statements, then this problem becomes not just decidable, but practically feasible. For in…
A General Completeness Theorem for Skip-free Star Algebras
Tobias Kappé, Todd Schmid
We consider process algebras with branching parametrized by an equational theory T, and show that it is possible to axiomatize bisimilarity under certain conditions on T. Our proof…