Abstract
We introduce Kleene algebra with tests, an equational system for manipulating programs. We give a purely equational proof, using Kleene algebra with tests and commutativity conditions, of the following classical result: every while program can be simulated by a while program with at most one while loop. The proof illustrates the use of Kleene algebra with tests and commutativity conditions in program equivalence proofs.
Author supplied keywords
Cite
CITATION STYLE
APA
Kozen, D. (1997). Kleene Algebra with Tests. ACM Transactions on Programming Languages and Systems, 19(3), 427–443. https://doi.org/10.1145/256167.256195
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free