Lenka Holíková

Publikace

• 2023

  HOLÍKOVÁ Lenka, HORKÝ Michal a SÍČ Juraj. Automata with Bounded Repetition in RE2. In: Computer Aided Systems Theory - EUROCAST 2022. Heidelberg: Springer Verlag, 2023, s. 232-239. ISSN 0302-9743.
  Detail

  HOLÍK Lukáš, HOLÍKOVÁ Lenka, SÍČ Juraj a VOJNAR Tomáš. Fast Matching of Regular Patterns with Synchronizing Counting. In: Foundations of Software Science and Computation Structures. Heidelberg: Springer Verlag, 2023, s. 392-412. ISSN 0302-9743.
  Detail

  HOLÍK Lukáš, HOLÍKOVÁ Lenka, SÍČ Juraj a VOJNAR Tomáš. Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report). Ithaca, 2023.
  Detail

• 2022

  HOLÍKOVÁ Lenka, HOLÍK Lukáš, HOMOLIAK Ivan, LENGÁL Ondřej, VEANES Margus a VOJNAR Tomáš. Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers. In: Proceedings of the 31st USENIX Security Symposium. Boston, MA: USENIX, 2022, s. 4165-4182. ISBN 978-1-939133-31-1.
  Detail

• 2020

  HOLÍKOVÁ Lenka, HOLÍK Lukáš, LENGÁL Ondřej, SAARIKIVI Olli, VEANES Margus a VOJNAR Tomáš. Regex Matching with Counting-Set Automata. Proceedings of the ACM on Programming Languages, roč. 4, č. 11, 2020, s. 1-30. ISSN 2475-1421.
  Detail

• 2019

  HOLÍKOVÁ Lenka a JANKŮ Petr. Solving String Constraints with Approximate Parikh Image. In: Proceedings of EUROCAST'19. Lecture Notes in Computer Science. Heidelberg: Springer International Publishing, 2019, s. 1-8. ISBN 978-3-030-45092-2.
  Detail

  HOLÍK Lukáš, HOLÍKOVÁ Lenka, LENGÁL Ondřej, SAARIKIVI Olli, VEANES Margus a VOJNAR Tomáš. Succinct Determinisation of Counting Automata via Sphere Construction. In: In Proc. of 17th Asian Symposium on Programming Languages and Systems - APLAS'19. Berlin Heidelberg: Springer Verlag, 2019, s. 468-489. ISSN 0302-9743.
  Detail

  HOLÍK Lukáš, HOLÍKOVÁ Lenka, LENGÁL Ondřej, SAARIKIVI Olli, VEANES Margus a VOJNAR Tomáš. Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report). Ithaca: Cornell University Library, 2019.
  Detail

• 2018

  HOLÍK Lukáš a HOLÍKOVÁ Lenka. Towards Smaller Invariants for Proving Coverability. In: Computer Aided Systems Theory - EUROCAST 2017. Berlin Heidelberg: Springer Verlag, 2018, s. 109-116. ISBN 978-3-319-74727-9.
  Detail