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

DOI10.1007/978-3-031-07469-1_3MaRDI QIDQ2164733zbMATH OpenOpenAlexFDO

Authors Sicheol Sung, Hyunjoon Cheon, 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

denial of serviceposition automataReDoSregular expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A characterization of Thompson digraphs.
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• Analyzing catastrophic backtracking behavior in practical regular expression matching
• Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA
• Characterization of Glushkov automata
• scientific article; zbMATH DE number 1962769 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• Memoized regular expressions
• On the Average Size of Glushkov’s Automata
• On the decidability of infix inclusion problem
• One-unambiguous regular languages
• Programming Techniques: Regular expression search algorithm
• Static detection of DoS vulnerabilities in programs that use regular expressions
• THE ABSTRACT THEORY OF AUTOMATA

Cited in

(2)

• Smaller representation of compiled regular expressions
• Benchmarking regular expression matching

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2164733)