eCommons@Cornell >
Faculty of Computing and Information Science >
Computing and Information Science >
Computing and Information Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/5761
Title:  Automatic Proof Generation in Kleene Algebra with Tests 
Authors:  Worthington, James 
Keywords:  computer science technical report 
Issue Date:  18Jan2007 
Publisher:  Cornell University 
Citation:  http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR20072069 
Abstract:  Kleene algebra (KA) is the algebra of regular events. Familiar
examples of Kleene algebras include regular sets, relational algebras, and trace algebras. A Kleene algebra with tests (KAT) is a Kleene algebra with an embedded Boolean subalgebra. The addition of tests allows one to encode while programs as KAT terms, thus the equational theory of KAT can express (propositional) program equivalence. More complicated statements about programs can be expressed in the Hoare theory of KAT, which suffices to encode Propositional Hoare Logic. In this paper, we prove the following results. First, there is a PSPACE transducer which takes equations of Kleene Algebra as input and outputs Hilbertstyle proofs of them in an equational implication calculus. Second, we give a feasible reduction from the equational theory of KAT to the equational theory of KA. Combined with the fact that the Hoare theory of KAT reduces efficiently to the equational theory of KAT, this yields an algorithm capable of generating proofs of a large class of statements about programs. 
URI:  http://hdl.handle.net/1813/5761 
Appears in Collections:  Computing and Information Science Technical Reports

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