Detail produktu

Chipmunk: A Tool for Matching of Regular Expressions.

HOLÍK, L. LENGÁL, O. TUROŇOVÁ, L. VOJNAR, T. VEANES, M.

Typ produktu

software

Abstrakt

The tool allows efficient matching regular expressions (regexes) with bounded repetition using deterministic automata with registers - counting-sets automata (CsA). The CsA can hold sets of bounded integers and can be manipulated by a limited portfolio of constant-time operations. Our experimental results confirm that deterministic CsAs produced from practical regexes with repetition are indeed vastly smaller than the corresponding DFAs. This prototype matcher based on CsA simulation handles practical regexes with repetition regardless of sizes of counter bounds. It easily copes with regexes with repetition where state-of-the-art matchers struggle.

Klíčová slova

regular expressions, pattern matching, security, counting-set automata

Datum vzniku

15.11.2020

Umístění

Nástroj i dokumentaci lze získat na URL: http://www.fit.vutbr.cz/research/groups/verifit/tools/chipmunk/

Možnosti využití

K využití výsledku jiným subjektem je vždy nutné nabytí licence

Licenční poplatek

Poskytovatel licence na výsledek nepožaduje licenční poplatek

www

Dokumenty