Kleene algebra with tests-Reference-Cited by-同舟云学术

Kleene algebra with tests

Published:1997-05 Issue:3 Volume:19 Page:427-443
ISSN:0164-0925
Container-title:ACM Transactions on Programming Languages and Systems
language:en
Short-container-title:ACM Trans. Program. Lang. Syst.

Author:

Kozen Dexter¹

Affiliation:

1. Cornell Univ., Ithaca, NY

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Software

Link

https://dl.acm.org/doi/pdf/10.1145/256167.256195

Reference39 articles.

1. AHO A. V. HOPCROFT J. E. AND ULLMAN J. D. 1975. The Design and Analysis of Computer Algorithms. Addison-Wesley Reading Mass. AHO A. V. HOPCROFT J. E. AND ULLMAN J. D. 1975. The Design and Analysis of Computer Algorithms. Addison-Wesley Reading Mass.

2. On the algebra of regular expressions;ANDERAA S.;Appl. Math.,1965

3. ARCHANGELSKY I<. V. 1992. A new finite complete solvable quasiequational calculus for algebra of regular languages. Manuscript Kiev State University. ARCHANGELSKY I<. V. 1992. A new finite complete solvable quasiequational calculus for algebra of regular languages. Manuscript Kiev State University.

4. BACKHOUSE R. C. 1975. Closure algorithms and the star-height problem of regular languages. Ph.D. thesis Imperial College London U.K. BACKHOUSE R. C. 1975. Closure algorithms and the star-height problem of regular languages. Ph.D. thesis Imperial College London U.K.

5. BERSTEL J. 1979. Transductions and Context-free Languages. Teubner Stuttgart Germany. BERSTEL J. 1979. Transductions and Context-free Languages. Teubner Stuttgart Germany.

Cited by 361 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A proof theory of right-linear (ω-)grammars via cyclic proofs;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Equivalence by Canonicalization for Synthesis-Backed Refactoring;Proceedings of the ACM on Programming Languages;2024-06-20

3. An Algebraic Language for Specifying Quantum Networks;Proceedings of the ACM on Programming Languages;2024-06-20

4. An input–output relational domain for algebraic data types and functional arrays;Formal Methods in System Design;2024-06-13

5. Towards determinism in PDL: relations and proof theory;Journal of Logic and Computation;2024-05-21