How to settle the ReDoS problem: back to the classical automata theory

DOI10.1007/978-3-031-07469-1_3OpenAlexW4285275532MaRDI QIDQ2164733

Hyunjoon Cheon, Sicheol Sung, Yo-Sub Han

Publication date: 16 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07469-1_3

zbMATH Keywords

regular expressionsdenial of serviceposition automataReDoS

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Smaller representation of compiled regular expressions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of Thompson digraphs.
• Characterization of Glushkov automata
• Memoized regular expressions
• On the decidability of infix inclusion problem
• Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
• THE ABSTRACT THEORY OF AUTOMATA
• Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions
• On the Average Size of Glushkov’s Automata
• Programming Techniques: Regular expression search algorithm
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• One-unambiguous regular languages

This page was built for publication: How to settle the ReDoS problem: back to the classical automata theory