Analyzing catastrophic backtracking behavior in practical regular expression matching
From MaRDI portal
Recommendations
- Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA
- On the semantics of regular expression parsing in the wild
- On the semantics of regular expression parsing in the wild
- scientific article; zbMATH DE number 7318987
- On the semantics of atomic subgroups in practical regular expressions
Cited in
(15)- On the decidability of infix inclusion problem
- How to settle the ReDoS problem: back to the classical automata theory
- The cut operation in subclasses of convex languages (extended abstract)
- On the semantics of regular expression parsing in the wild
- On the semantics of atomic subgroups in practical regular expressions
- Re-examining regular expressions with backreferences
- Trading plaintext-awareness for simulatability to achieve chosen ciphertext security
- Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA
- Tight bounds for cut-operations on deterministic finite automata
- On the semantics of regular expression parsing in the wild
- Static detection of DoS vulnerabilities in programs that use regular expressions
- Dynamic behavior matching: a complexity analysis and new approximation algorithms
- The cut operation in subclasses of convex languages
- On the decidability of infix inclusion problem
- Benchmarking regular expression matching
This page was built for publication: Analyzing catastrophic backtracking behavior in practical regular expression matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994938)
