Regular expressions are commonly used for finding and extracting matches from sequence
data. Due to the inherent ambiguity of regular expressions, a disambiguation policy must be …

Runtime monitors analyze system execution traces for policy compliance. Monitors for
propositional specification languages, such as metric temporal logic (MTL), produce …

We present a formalization of a matching algorithm for extended regular expression
matching based on locations and symbolic derivatives which supports intersection …

Regular expressions (regexes) are a fundamental concept across the fields of computer
science. However, they can also induce the Regular expression Denial of Service (ReDoS) …

Brzozowski introduced the notion of derivatives for regular expressions. They can be used
for a very simple regular expression matching algorithm. Sulzmann and Lu cleverly …

Real-world regular expressions (regexes for short) have a wide range of applications in
software. However, the support for regexes in test generation is insufficient. For example …

We describe the formalization of a regular expression (RE) parsing algorithm that produces
a bit representation of its parse tree in the dependently typed language Agda. The algorithm …

We present and illustrate Kleenex, a language for expressing general nondeterministic finite
transducers, and its novel compilation to streaming string transducers with essentially …

Brzozowski introduced the notion of derivatives for regular expressions. They can be used
for a very simple regular expression matching algorithm. Sulzmann and Lu cleverly …

There is a growing interest in the validation of RDF based solutions where one can express
the topology of an RDF graph using some schema language that can check if RDF …