Lenka Turonová

According to our database, Lenka Turonová authored at least 12 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

Fast Matching of Regular Patterns with Synchronizing Counting.

Lukás Holík, Juraj Síc, Lenka Turonová, Tomás Vojnar

Proceedings of the Foundations of Software Science and Computation Structures, 2023

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

Proceedings of the 31st USENIX Security Symposium, 2022

Automata with Bounded Repetition in RE2.

Michal Horký, Juraj Síc, Lenka Turonová

Proceedings of the Computer Aided Systems Theory - EUROCAST 2022, 2022

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

Dataset, August, 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

Dataset, August, 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

Dataset, August, 2020

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

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

Solving String Constraints with Approximate Parikh Image.

Petr Janku, Lenka Turonová

Proceedings of the Computer Aided Systems Theory - EUROCAST 2019, 2019

Succinct Determinisation of Counting Automata via Sphere Construction.

Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar

Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2017

Towards Smaller Invariants for Proving Coverability.

Lenka Turonová, Lukás Holík

Proceedings of the Computer Aided Systems Theory - EUROCAST 2017, 2017