From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Z3-Noodler: An Automata-based String Solver (Technical Report).

Y. Chen, D. Chocholatý, V. Havlena, L. Holík, O. Lengál, и J. Síc. CoRR, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Helga Holik

Josef Holik

Helga Holik

Helga Holik

Ludmilla Holik

Другие публикации лиц с тем же именем

Composed Bisimulation for Tree Automata.P. Abdulla, A. Bouajjani, L. Holík, L. Kaati, and T. Vojnar. CIAA, volume 5148 of Lecture Notes in Computer Science, page 212-222. Springer, (2008)Regex matching with counting-set automata.L. Turonová, L. Holík, O. Lengál, O. Saarikivi, M. Veanes, and T. Vojnar. Proc. ACM Program. Lang., 4 (OOPSLA): 218:1-218:30 (2020)Low-Level Bi-Abduction.L. Holík, P. Peringer, A. Rogalewicz, V. Soková, T. Vojnar, and F. Zuleger. ECOOP, volume 222 of LIPIcs, page 19:1-19:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers.L. Turonová, L. Holík, I. Homoliak, O. Lengál, M. Veanes, and T. Vojnar. USENIX Security Symposium, page 4165-4182. USENIX Association, (2022)Counterexample Validation and Interpolation-Based Refinement for Forest Automata.L. Holík, M. Hruska, O. Lengál, A. Rogalewicz, and T. Vojnar. VMCAI, volume 10145 of Lecture Notes in Computer Science, page 288-309. Springer, (2017)Mediating for Reduction (on Minimizing Alternating Büchi Automata).P. Abdulla, Y. Chen, L. Holík, and T. Vojnar. FSTTCS, volume 4 of LIPIcs, page 1-12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata.P. Abdulla, L. Holík, B. Jonsson, O. Lengál, C. Trinh, and T. Vojnar. ATVA, volume 8172 of Lecture Notes in Computer Science, page 224-239. Springer, (2013)Simulation Algorithms for Symbolic Automata.L. Holík, O. Lengál, J. Síc, M. Veanes, and T. Vojnar. ATVA, volume 11138 of Lecture Notes in Computer Science, page 109-125. Springer, (2018)Z3-Noodler: An Automata-based String Solver (Technical Report).Y. Chen, D. Chocholatý, V. Havlena, L. Holík, O. Lengál, and J. Síc. CoRR, (2023)Fast Matching of Regular Patterns with Synchronizing Counting.L. Holík, J. Síc, L. Turonová, and T. Vojnar. FoSSaCS, volume 13992 of Lecture Notes in Computer Science, page 392-412. Springer, (2023)