Results 1  10
of
24
A completeness theorem for Kleene algebras and the algebra of regular events
 Information and Computation
, 1994
"... We givea nitary axiomatization of the algebra of regular events involving only equations and equational implications. Unlike Salomaa's axiomatizations, the axiomatization given here is sound for all interpretations over Kleene algebras. 1 ..."
Abstract

Cited by 250 (28 self)
 Add to MetaCart
(Show Context)
We givea nitary axiomatization of the algebra of regular events involving only equations and equational implications. Unlike Salomaa's axiomatizations, the axiomatization given here is sound for all interpretations over Kleene algebras. 1
On Kleene Algebras and Closed Semirings
, 1990
"... Kleene algebras are an important class of algebraic structures that arise in diverse areas of computer science: program logic and semantics, relational algebra, automata theory, and the design and analysis of algorithms. The literature contains several inequivalent definitions of Kleene algebras and ..."
Abstract

Cited by 55 (6 self)
 Add to MetaCart
Kleene algebras are an important class of algebraic structures that arise in diverse areas of computer science: program logic and semantics, relational algebra, automata theory, and the design and analysis of algorithms. The literature contains several inequivalent definitions of Kleene algebras and related algebraic structures [2, 14, 15, 5, 6, 1, 10, 7]. In this paper we establish some new relationships among these structures. Our main results are: There is a Kleene algebra in the sense of [6] that is not *continuous. The categories of *continuous Kleene algebras [5, 6], closed semirings [1, 10] and Salgebras [2] are strongly related by adjunctions. The axioms of Kleene algebra in the sense of [6] are not complete for the universal Horn theory of the regular events. This refutes a conjecture of Conway [2, p. 103]. Righthanded Kleene algebras are not necessarily lefthanded Kleene algebras. This verifies a weaker version of a conjecture of Pratt [15].
Certification of compiler optimizations using Kleene algebra with tests
 STUCKEY (EDS.), PROC. RST INTERNAT. CONF. COMPUTATIONAL LOGIC (CL2000), LECTURE NOTES IN ARTI CIAL INTELLIGENCE
, 2000
"... We use Kleene algebra with tests to verify a wide assortment ofcommon compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation, loop hoisting, induction variable elimination, instruction scheduling, algebraic simplification, loop unrolling, elimin ..."
Abstract

Cited by 45 (13 self)
 Add to MetaCart
(Show Context)
We use Kleene algebra with tests to verify a wide assortment ofcommon compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation, loop hoisting, induction variable elimination, instruction scheduling, algebraic simplification, loop unrolling, elimination of redundant instructions, array bounds check elimination, and introduction of sentinels. In each of these cases, we give a formal equational proof of the correctness of the optimizing transformation.
Shuffle on Trajectories: Syntactic Constraints
 Theor. Comp. Sci
, 1998
"... We introduce and investigate new methods to define parallel composition of words and languages. The operation of parallel composition leads to new shufflelike operations defined by syntactic constraints on the usual shuffle operation. The approach is applicable to concurrency, providing a method to ..."
Abstract

Cited by 28 (5 self)
 Add to MetaCart
We introduce and investigate new methods to define parallel composition of words and languages. The operation of parallel composition leads to new shufflelike operations defined by syntactic constraints on the usual shuffle operation. The approach is applicable to concurrency, providing a method to define parallel composition of processes. It is also applicable to parallel computation. The operations are introduced using a uniform method based on the notion of trajectory. As a consequence, we obtain a very intuitive geometrical interpretation of the parallel composition operation. These operations lead in a natural way to a large class of semirings. The approach is amazingly flexible, diverse concepts from the theory of concurrency can be introduced and studied in this framework. For instance, we provide examples of applications to fairness property and to parallelization of noncontextfree languages in terms of contextfree and even regular languages. This paper concetrates on syntactic constraints. Semantic constraints will be dealt with in a forthcoming contribution. TUCS Research Group
Typed Kleene algebra
, 1998
"... In previous work we havefound it necessary to argue that certain theorems of Kleene algebra hold even when the symbols are interpreted as nonsquare matrices. In this note we de ne and investigate typed Kleene algebra, a typed version of Kleene algebra in which objects have types s! t. Although nonsq ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
(Show Context)
In previous work we havefound it necessary to argue that certain theorems of Kleene algebra hold even when the symbols are interpreted as nonsquare matrices. In this note we de ne and investigate typed Kleene algebra, a typed version of Kleene algebra in which objects have types s! t. Although nonsquare matrices are the principal motivation, there are many other useful interpretations: traces, binary relations, Kleene algebra with tests. We give a set of typing rules and show that every expression has a unique most general typing (mgt). Then we prove the following metatheorem that incorporates the abovementioned results for nonsquare matrices as special cases. Call an expression 1free if it contains only the Kleene algebra operators (binary) +, (unary) +, 0, and,but no occurrence of 1 or. Then every universal 1free formula that is a theorem of Kleene algebra is also a theorem of typed Kleene algebra under its most general typing. The metatheorem is false without the restriction to 1free formulas.
Parikh’s theorem in commutative Kleene algebra
 In Logic in Computer Science
, 1999
"... Parikh’s Theorem says that the commutative image of every context free language is the commutative image of some regular set. Pilling has shown that this theorem is essentially a statement about least solutions of polynomial inequalities. We prove the following general theorem of commutative Kleene ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
(Show Context)
Parikh’s Theorem says that the commutative image of every context free language is the commutative image of some regular set. Pilling has shown that this theorem is essentially a statement about least solutions of polynomial inequalities. We prove the following general theorem of commutative Kleene algebra, of which Parikh’s and Pilling’s theorems are special cases: Every finite system of polynomial inequalities fi(x1�:::�xn) xi, 1 i n, over a commutative Kleene algebra K has a unique least solution in K n; moreover, the components of the solution are given by polynomials in the coefficients of the fi. We also give a closedform solution in terms of the Jacobian matrix of the system. 1
On Action Algebras
, 1993
"... Action algebras have been proposed by Pratt [22] as an alternative to Kleene algebras [8, 9]. Their chief advantage over Kleene algebras is that they form a finitelybased equational variety, so the essential properties of (iteration) are captured purely equationally. However, unlike Kleene algebras ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
(Show Context)
Action algebras have been proposed by Pratt [22] as an alternative to Kleene algebras [8, 9]. Their chief advantage over Kleene algebras is that they form a finitelybased equational variety, so the essential properties of (iteration) are captured purely equationally. However, unlike Kleene algebras, they are not closed under the formation of matrices, which renders them inapplicable in certain constructions in automata theory and the design and analysis of algorithms. In this paper we consider a class of action algebras called action lattices. An action lattice is simply an action algebra that forms a lattice under its natural order. Action lattices combine the best features of Kleene algebras and action algebras: like action algebras, they form a finitelybased equational variety; like Kleene algebras, they are closed under the formation of matrices. Moreover, they form the largest subvariety of action algebras for which this is true. All common examples of Kleene algebras appearing in automata theory, logics of programs, relational algebra, and the design and analysis of algorithms are action lattices.
On the Complexity of Reasoning in Kleene Algebra
 Information and Computation
, 1997
"... We study the complexity of reasoning in Kleene algebra and *continuous Kleene algebra in the presence of extra equational assumptions E; that is, the complexity of deciding the validity of universal Horn formulas E ! s = t, where E is a finite set of equations. We obtain various levels of complexi ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
(Show Context)
We study the complexity of reasoning in Kleene algebra and *continuous Kleene algebra in the presence of extra equational assumptions E; that is, the complexity of deciding the validity of universal Horn formulas E ! s = t, where E is a finite set of equations. We obtain various levels of complexity based on the form of the assumptions E. Our main results are: for * continuous Kleene algebra, ffl if E contains only commutativity assumptions pq = qp, the problem is \Pi 0 1 complete; ffl if E contains only monoid equations, the problem is \Pi 0 2 complete; ffl for arbitrary equations E, the problem is \Pi 1 1  complete. The last problem is the universal Horn theory of the *continuous Kleene algebras. This resolves an open question of Kozen (1994). 1 Introduction Kleene algebra (KA) is fundamental and ubiquitous in computer science. Since its invention by Kleene in 1956, it has arisen in various forms in program logic and semantics [17, 28], relational algebra [27, 32], aut...