Results 11  20
of
1,252
Synchronous Kleene Algebra
, 2009
"... The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner’s SCCS calculus. The resulting algebraic structure is called synchronous Kleene algebra. Models are given in terms of sets of synchronous strings and finite automata accepting s ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner’s SCCS calculus. The resulting algebraic structure is called synchronous Kleene algebra. Models are given in terms of sets of synchronous strings and finite automata accepting
Probabilistic concurrent kleene algebra
 Proceedings 11th International Workshop on Quantitative Aspects of Programming Languages and Systems
, 2013
"... We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of probabilistic automata modulo probabilistic simulation. We use the resu ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of probabilistic automata modulo probabilistic simulation. We use
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 11 (5 self)
 Add to MetaCart
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
Hypotheses in Kleene Algebra
, 1994
"... Kleene algebra (an Horn axiomatization of Kleene's algebra of regular events) has proved to be an effective tool for reasoning about programs. Within the algebra, we can reason succinctly about both ordinary safety properties and important program transformations such as loop unwinding, change ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Kleene algebra (an Horn axiomatization of Kleene's algebra of regular events) has proved to be an effective tool for reasoning about programs. Within the algebra, we can reason succinctly about both ordinary safety properties and important program transformations such as loop unwinding, change
Termination in Modal Kleene Algebra
 EXPLORING NEW FRONTIERS OF THEORETICAL INFORMATICS. IFIP INTERNATIONAL FEDERATION FOR INFORMATION PROCESSING SERIES 155. KLUWER 2004, 653–666
, 2004
"... Modal Kleene algebras are Kleene algebras with forward and backward modal operators defined via domain and codomain operations. The paper investigates the algebraic structure of modal operators. It studies and compares different notions of termination in this class, including an algebraic correspond ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
Modal Kleene algebras are Kleene algebras with forward and backward modal operators defined via domain and codomain operations. The paper investigates the algebraic structure of modal operators. It studies and compares different notions of termination in this class, including an algebraic
Automated reasoning in Kleene algebra
 CADE 2007, LNCS 4603
, 2007
"... Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. We demonstrate that offtheshelf automated proof and counterexample search is an interesting alternative if combined with the right ..."
Abstract

Cited by 29 (13 self)
 Add to MetaCart
domain model. We implement variants of Kleene algebras axiomatically in Prover9/Mace4 and perform proof experiments about Hoare, dynamic, temporal logics, concurrency control and termination analysis. They confirm that a simple automated analysis of some important program properties is possible
Kleene Algebra with Equations
"... Abstract. We identify sufficient conditions for the construction of free language models for systems of Kleene algebra with additional equations. The construction applies to a broad class of extensions of KA and provides a uniform approach to deductive completeness and coalgebraic decision procedur ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We identify sufficient conditions for the construction of free language models for systems of Kleene algebra with additional equations. The construction applies to a broad class of extensions of KA and provides a uniform approach to deductive completeness and coalgebraic decision
Proof Automation in Kleene Algebra
"... Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it has been demonstrated that offtheshelf automated proof and counterexample search is an interesting alternative if comb ..."
Abstract
 Add to MetaCart
if combined with the right domain model. Furthermore it has been shown that variants of Kleene algebra might provide lightweight formal methods with heavyweight automation. In this paper we give a brief overview of a number of program analysis and computer mathematics tasks where (variants of) Kleene
Concurrent Kleene Algebra
"... A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange law. We show applicability of the algebra to a partiallyordered trace model of program execution semantics and demonstrate its usefu ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange law. We show applicability of the algebra to a partiallyordered trace model of program execution semantics and demonstrate its
Kleene algebra with tests: Completeness and decidability
 IN PROC. OF 10TH INTERNATIONAL WORKSHOP ON COMPUTER SCIENCE LOGIC (CSL’96
, 1996
"... Kleene algebras with tests provide a rigorous framework for equational specification and verification. They have been used successfully in basic safety analysis, sourcetosource program transformation, and concurrency control. We prove the completeness of the equational theory of Kleene algebra w ..."
Abstract

Cited by 37 (15 self)
 Add to MetaCart
Kleene algebras with tests provide a rigorous framework for equational specification and verification. They have been used successfully in basic safety analysis, sourcetosource program transformation, and concurrency control. We prove the completeness of the equational theory of Kleene algebra
Results 11  20
of
1,252