@inproceedings{veanes2019symbolic,
author = {Veanes, Margus and Saarikivi, Olli and Wan, Tiki and Xu, Eric},
title = {Symbolic Regex Matcher},
booktitle = {TACAS},
year = {2019},
month = {April},
abstract = {Symbolic regex matcher is a new open source .NET regular expression matching tool and match generator in the Microsoft Automata framework. It is based on the .NET regex parser in combination with a set based representation of character classes. The main feature of the tool is that the core matching algorithms are based on symbolic derivatives that support extended regular expression operations such as intersection and complement and also support a large set of commonly used features such as bounded loop quantifiers. The particularly useful features of the tool are that it supports full UTF16 encoded strings, the match generation is backtracking free, thread safe, and parallelizes with low overhead in multithreaded applications. We discuss the main design decisions behind the tool, explain the core algorithmic ideas and how the tool works, discuss some practical usage scenarios, and compare it to existing state of the art.},
publisher = {Springer},
url = {http://approjects.co.za/?big=en-us/research/publication/symbolic-regex-matcher/},
}