Towards Smaller Invariants for Proving Coverability. - Lenka Turonová; Lukás Holík (EUROCAST (2), 2017)

Succinct Determinisation of Counting Automata via Sphere Construction. - Lukás Holík; Ondrej Lengál; Olli Saarikivi; Lenka Turonová; Margus Veanes; Tomás Vojnar (APLAS, 2019)

Solving String Constraints with Approximate Parikh Image. - Petr Janku; Lenka Turonová (EUROCAST (1), 2019)

Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report). - Lukás Holík; Ondrej Lengál; Olli Saarikivi; Lenka Turonová; Margus Veanes; Tomás Vojnar (CoRR, 2019)

Regex matching with counting-set automata. - Lenka Turonová; Lukás Holík; Ondrej Lengál; Olli Saarikivi; Margus Veanes; Tomás Vojnar (Proc. ACM Program. Lang., 2020)

Dataset for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata". - Lukás Holík; Ondrej Lengál; Olli Saarikivi; Lenka Turonová; Margus Veanes; Tomás Vojnar (Zenodo, 2020)

Dataset for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata". - Lukás Holík; Ondrej Lengál; Olli Saarikivi; Lenka Turonová; Margus Veanes; Tomás Vojnar (Zenodo, 2020)

Artifact for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata". - Lukás Holík; Ondrej Lengál; Olli Saarikivi; Lenka Turonová; Margus Veanes; Tomás Vojnar (Zenodo, 2020)

Automata with Bounded Repetition in RE2. - Michal Horký; Juraj Síc; Lenka Turonová (EUROCAST, 2022)

Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers. - Lenka Turonová; Lukás Holík; Ivan Homoliak; Ondrej Lengál; Margus Veanes; Tomás Vojnar (USENIX Security Symposium, 2022)

Fast Matching of Regular Patterns with Synchronizing Counting. - Lukás Holík; Juraj Síc; Lenka Turonová; Tomás Vojnar (FoSSaCS, 2023)

Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report). - Lukás Holík; Juraj Síc; Lenka Turonová; Tomás Vojnar (CoRR, 2023)