How to Settle the ReDoS Problem: Back to the Classical Automata Theory-Reference-Cited by-同舟云学术

How to Settle the ReDoS Problem: Back to the Classical Automata Theory

Published:2022 Issue: Volume: Page:34-49
ISSN:0302-9743
Container-title:Implementation and Application of Automata
language:
Short-container-title:

Author:

Sung Sicheol,Cheon Hyunjoon,Han Yo-Sub

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-07469-1_3

Reference32 articles.

1. Berglund, M., Drewes, F., van der Merwe, B.: Analyzing catastrophic backtracking behavior in practical regular expression matching. In: Proceedings of the 14th International Conference on Automata and Formal Languages, pp. 109–123 (2014)

2. Berglund, M., van der Merwe, B.: Regular expressions with backreferences re-examined. In: Proceedings of the Prague Stringology Conference 2017, pp. 30–41 (2017)

3. Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inf. Comput. 140(2), 229–253 (1998)

4. Câmpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. Int. J. Found. Comput. Sci. 14(6), 1007–1018 (2003)

5. Câmpeanu, C., Salomaa, K., Yu, S.: Regex and extended regex. In: Proceedings of the 7th International Conference on Implementation and Application of Automata, pp. 77–84 (2003)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Benchmarking Regular Expression Matching;Lecture Notes in Computer Science;2024

2. Improving Developers’ Understanding of Regex Denial of Service Tools through Anti-Patterns and Fix Strategies;2023 IEEE Symposium on Security and Privacy (SP);2023-05

3. Smaller Representation of Compiled Regular Expressions;Implementation and Application of Automata;2023