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: Completeness and Decidability
Authors: Kozen, Dexter
Smith, Frederick
Keywords: computer science
technical report
Issue Date: Apr-1996
Publisher: Cornell University
Abstract: Kleene algebras with tests provide a rigorous framework for equational specification and verification. They have been used successfully in basic safety analysis, source-to-source program transformation, and concurrency control. We prove the completeness of the equational theory of Kleene algebra with tests and *-continuous Kleene algebra with tests over language-theoretic and relational models. We also show decidability. Cohen's reduction of Kleene algebra with hypotheses of the form $r=0$ to Kleene algebra without hypotheses is simplified and extended to handle Kleene algebras with tests.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
96-1582.pdf253.17 kBAdobe PDFView/Open
96-1582.ps234.56 kBPostscriptView/Open

Refworks Export

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


© 2014 Cornell University Library Contact Us