Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: Kleene algebra with tests and commutativity conditions
Authors: Kozen, Dexter
Keywords: computer science
technical report
Issue Date: Jan-1996
Publisher: Cornell University
Abstract: We give an 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 extra conditions in program equivalence proofs. We also show, using a construction of Cohen, that the universal Horn theory of *-continuous Kleene algebras is not finitely axiomatizable.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
96-1563.pdf211.17 kBAdobe PDFView/Open
96-1563.ps177.61 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us