Skip to main content


eCommons@Cornell

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

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7220
Title: Kleene algebra with tests and commutativity conditions
Authors: Kozen, Dexter
Keywords: computer science
technical report
Issue Date: Jan-1996
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR96-1563
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.
URI: http://hdl.handle.net/1813/7220
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