Kleene algebra with tests

Authors:
Dexter Kozen
Affiliations:
Cornell Univ., Ithaca, NY
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1997

Citing 22
Cited 112

The Kleene and the Parikh theorem in complete semirings

14th International Colloquium on Automata, languages and programming
Kleene's theorem revisited

Selected contributions on Trends, techniques, and problems in theoretical computer science. 4th International Meeting of Young Computer Scientists
On the decidability of some problems about rational subsets of free partially commutative monoids

Theoretical Computer Science
On Kleene algebras and closed semirings

MFCS '90 Proceedings on Mathematical foundations of computer science 1990
Dynamic algebras as a well-behaved fragment of relation algebras

AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
A semiring on convex polygons and zero-sum cycle problems

SIAM Journal on Computing
Action logic and pure induction

JELIA '90 Proceedings of the European workshop on Logics in AI
Logics of programs

Handbook of theoretical computer science (vol. B)
The design and analysis of algorithms

The design and analysis of algorithms
Complete systems of B -rational identities

Theoretical Computer Science
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Two Complete Axiom Systems for the Algebra of Regular Events

Journal of the ACM (JACM)
On folk theorems

Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules

Communications of the ACM
Semirings, Automata and Languages

Semirings, Automata and Languages
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Kleene Algebra withTests and Commutativity Conditions

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Kleene Algebra with Tests: Completeness and Decidability

CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
On Induction vs. *-Continuity

Logic of Programs, Workshop
On the Complexity of Reasoning in Kleene Algebra

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The Complexity of Kleene Algebra with Tests

The Complexity of Kleene Algebra with Tests

On Hoare logic and Kleene algebra with tests

ACM Transactions on Computational Logic (TOCL)
Deriving Focused Lattice Calculi

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Certification of Compiler Optimizations Using Kleene Algebra with Tests

CL '00 Proceedings of the First International Conference on Computational Logic
From Kleene Algebra to Refinement Algebra

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Kleene under a Demonic Star

AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Substructural logic and partial correctness

ACM Transactions on Computational Logic (TOCL)
Some results in dynamic model theory

Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Towards a refinement algebra

Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Automated soundness proofs for dataflow analyses and transformations via local rules

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A coalgebraic approach to Kleene algebra with tests

Theoretical Computer Science - Selected papers of CMCS'03
A Conceptual View of Web-Based E-Learning Systems

Education and Information Technologies
Logical verification and equational verification

ACM SIGACT News
Personalised Web-Based Learning Systems

ICALT '05 Proceedings of the Fifth IEEE International Conference on Advanced Learning Technologies
Conceptual modelling of web information systems

Data & Knowledge Engineering
Quality Assurance in the Design of Web Information Systems

QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Conditional XPath

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Algebras of modal operators and partial correctness

Theoretical Computer Science - Algebraic methodology and software technology
Demonic fixed points

Acta Cybernetica
Kleene algebra with domain

ACM Transactions on Computational Logic (TOCL)
Describing data flow analysis techniques with Kleene algebra

Science of Computer Programming
Kleene getting lazy

Science of Computer Programming
Personalisation of web information systems - A term rewriting approach

Data & Knowledge Engineering
Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Refinement Algebra for Probabilistic Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
A formal semantics for Gaia liveness rules and expressions

International Journal of Agent-Oriented Software Engineering
Computing Properties of Numerical Imperative Programs by Symbolic Computation

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Algebraic Structure of Web Services

Electronic Notes in Theoretical Computer Science (ENTCS)
Circulations, Fuzzy Relations and Semirings

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Probabilistic Choice in Refinement Algebra

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Modal Semirings Revisited

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Customising Web Information Systems According to User Preferences

World Wide Web
Enabledness and termination in refinement algebra

Science of Computer Programming
Proving optimizations correct using parameterized program equivalence

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Enforcing Security Policies on Programs

Proceedings of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06
Toward Solving Equations in Kleene Algebras

Proceedings of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07
Concurrent Kleene Algebra

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Formal verification of high-level data-flow synthesis designs using relational modeling and symbolic computation

Integration, the VLSI Journal
Visibly Pushdown Kleene Algebra and Its Use in Interprocedural Analysis of (Mutually) Recursive Programs

RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Composing Partially Ordered Monads

RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Foundations of Concurrent Kleene Algebra

RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
A While Program Normal Form Theorem in Total Correctness

RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Diagram Chase in Relational System Development

Electronic Notes in Theoretical Computer Science (ENTCS)
A sketch of a dynamic epistemic semiring

Information and Computation
A sketch of a dynamic epistemic semiring

WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
A formal language for electronic contracts

FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Term rewriting for web information systems: termination and church-rosser property

WISE'07 Proceedings of the 8th international conference on Web information systems engineering
Latest news about demonic algebra with domain

RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
On the structure of demonic refinement algebras with enabledness and termination

RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
A non-probabilistic relational model of probabilistic Kleene algebras

RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Automated reasoning for hybrid systems: two case studies

RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Solving linear equations in *-continuous action lattices

RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Knowledge and games in modal semirings

RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Invariants and well-foundedness in program algebra

ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
On automated program construction and verification

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Partial, total and general correctness

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Quantified differential dynamic logic for distributed hybrid systems

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Untyping typed algebraic structures and colouring proof nets of cyclic linear logic

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Reasoning about loops in total and general correctness

UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Regular expression containment: coinductive axiomatization and computational interpretation

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A formal model for service mediators

ER'10 Proceedings of the 2010 international conference on Advances in conceptual modeling: applications and challenges
Internal axioms for domain semirings

Science of Computer Programming
Verification of common interprocedural compiler optimizations using visibly pushdown kleene algebra

AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Partial derivative automata formalized in Coq

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Partially ordered two-way büchi automata

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Quantified differential invariants

Proceedings of the 14th international conference on Hybrid systems: computation and control
Building structured theories

RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Automated engineering of relational and algebraic methods in isabelle/hol

RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Logic and compositional verification of hybrid systems

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
A proof-theoretic approach to tactics

MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
A framework for kleene algebra with an embedded structure

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Towards an algebra of hybrid systems

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Verification of pushdown systems using omega algebra with domain

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
wp Is wlp

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
A proof-theoretic approach to hierarchical math library organization

MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Termination of real-time programs: definitely, definitely not, or maybe

UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Modal design algebra

UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
An algorithmic approach to high-level personalisation of web information systems

WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Reasoning algebraically about probabilistic loops

ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
On the representation of kleene algebras with tests

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
An axiomatization of arrays for kleene algebra with tests

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Demonic algebra with domain

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Lazy semiring neighbours and some applications

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Omega algebra, demonic refinement algebra and commands

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Semigroupoid interfaces for relation-algebraic programming in haskell

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Using probabilistic kleene algebra for protocol verification

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
On two dually nondeterministic refinement algebras

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Relational semantics for higher-order programs

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Continuous action system refinement

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
The linear algebra of UTP

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Refinement algebra with operators for enabledness and termination

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Quantales and temporal logics

AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Algebra of monotonic boolean transformers

SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
Bargaining in e-business systems

ER'05 Proceedings of the 24th international conference on Perspectives in Conceptual Modeling
Dual Choice and Iteration in an Abstract Algebra of Action

Studia Logica
Brzozowski's algorithm (co)algebraically

Logic and Program Semantics
The Complete Proof Theory of Hybrid Systems

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Logics of Dynamical Systems

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Logical analysis of hybrid systems: a complete answer to a complexity challenge

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Operational semantics for SPARQL update

JIST'11 Proceedings of the 2011 joint international conference on The Semantic Web
Computing Properties of Numerical Imperative Programs by Symbolic Computation

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Reverse exchange for concurrency and local reasoning

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Transitive separation logic

RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Unifying lazy and strict computations

RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Deciding regular expressions (in-)equivalence in coq

RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Algebra-coalgebra duality in brzozowski's minimization algorithm

ACM Transactions on Computational Logic (TOCL)
FASER Formal and Automatic Security Enforcement by Rewriting by BPA algebra with test

International Journal of Grid and Utility Computing
Extended designs algebraically

Science of Computer Programming
Kleene algebra with tests and coq tools for while programs

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Program analysis and verification based on kleene algebra in Isabelle/HOL

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
On the average size of glushkov and equation automata for KAT expressions

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
NetKAT: semantic foundations for networks

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce Kleene algebra with tests, an equational system for manipulating programs. We give a purely 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 can be simulated by a while program with at most one while loop. The proof illustrates the use of Kleene algebra with tests and commutativity conditions in program equivalence proofs.