A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity-Reference-Cited by-同舟云学术

A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity

Published:2020-07-08 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Grabmayer Clemens¹,Fokkink Wan²

Affiliation:

1. Department of Computer Science, Gran Sasso Science Institute, L'Aquila, Italy

2. Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands

Publisher

ACM

Link

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

Reference28 articles.

1. Partial derivatives of regular expressions and finite automaton constructions

2. A characterization of regular expressions under bisimulation

3. Process Algebra with Iteration and Nesting

4. Doeko Bosscher. 1997. Grammars Modulo Bisimulation. Ph.D. Dissertation. University of Amsterdam. Doeko Bosscher. 1997. Grammars Modulo Bisimulation. Ph.D. Dissertation. University of Amsterdam.

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

1. Sequential Value Passing Yields a Kleene Theorem for Processes;Lecture Notes in Computer Science;2024

2. A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity;Logical Methods in Computer Science;2023-06-29

3. A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests;Programming Languages and Systems;2023

4. Milner’s Proof System for Regular Expressions Modulo Bisimilarity is Complete;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02

5. Axiomatizing recursion-free, regular monitors;Journal of Logical and Algebraic Methods in Programming;2022-06