Forkable Regular Expressions
Formal Languages and Automata Theory
2015-12-09 v2 Logic in Computer Science
Programming Languages
Abstract
We consider forkable regular expressions, which enrich regular expressions with a fork operator, to establish a formal basis for static and dynamic analysis of the communication behavior of concurrent programs. We define a novel compositional semantics for forkable expressions, establish their fundamental properties, and define derivatives for them as a basis for the generation of automata, for matching, and for language containment tests. Forkable expressions may give rise to non-regular languages, in general, but we identify sufficient conditions on expressions that guarantee finiteness of the automata construction via derivatives.
Cite
@article{arxiv.1510.07293,
title = {Forkable Regular Expressions},
author = {Martin Sulzmann and Peter Thiemann},
journal= {arXiv preprint arXiv:1510.07293},
year = {2015}
}
Comments
12 pages plus technical appendix, to appear in LATA 2016