Kleene algebra with tests and commutativity conditions
| dc.contributor.author | Kozen, Dexter | en_US |
| dc.date.accessioned | 2007-04-23T18:05:30Z | |
| dc.date.available | 2007-04-23T18:05:30Z | |
| dc.date.issued | 1996-01 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 216235 bytes | |
| dc.format.extent | 181869 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR96-1563 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7220 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Kleene algebra with tests and commutativity conditions | en_US |
| dc.type | technical report | en_US |