On DoS Vulnerability of Regular Expressions, with and Without Backreferences

No abstract is available for this paper.

• Publication year

  2025

• Venue

  IEEE Computer Security Foundations Symposium

• Publication date

  2025-06-16

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/CSF64896.2025.00011
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Measuring the expressive power of practical regular expressions by classical stacking automata models

  2025cited by this paper
• Efficient Matching of Regular Expressions with Lookaround Assertions

  2024cited by this paper
• Repairing Regex-Dependent String Functions

  2024cited by this paper
• Regular Expressions with Backreferences and Lookaheads Capture NLOG

  2024cited by this paper
• Efficient Matching with Memoization for Regexes with Look-around and Atomic Grouping (Extended Version)

  2024cited by this paper
• Repairing Regular Expressions for Extraction

  2023cited by this paper
• On the Expressive Power of Regular Expressions with Backreferences

  2023cited by this paper
• On Lookaheads in Regular Expressions with Backreferences

  2023cited by this paper
• Linear Matching of JavaScript Regular Expressions

  2023cited by this paper
• Sound Static Analysis of Regular Expressions for Vulnerabilities to Denial of Service Attacks

  2023cited by this paper
• Re-examining regular expressions with backreferences

  2022cited by this paper
• Using Selective Memoization to Defeat Regular Expression Denial of Service (ReDoS)

  2021cited by this paper
• Repairing DoS Vulnerability of Real-World Regexes

  2020cited by this paper
• Deterministic Regular Expressions with Back-References

  2018cited by this paper
• The impact of regular expression denial of service (ReDoS) in practice: an empirical study at the ecosystem scale

  2018cited by this paper
• Turning evil regexes harmless

  2017cited by this paper
• Inference of Regular Expressions for Text Extraction from Examples

  2016cited by this paper
• Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA

  2016cited by this paper
• Characterising REGEX languages by regular languages equipped with factor-referencing

  2014influential reference
• Checking Time Linearity of Regular Expression Matching Based on Backtracking

  2014cited by this paper
• Pattern matching with variables: A multivariate complexity analysis

  2013cited by this paper
• Extended Regular Expressions: Succinctness and Decidability

  2012cited by this paper
• Fast and Precise Sanitizer Analysis with BEK

  2011cited by this paper
• General Algorithms for Testing the Ambiguity of Finite Automata

  2008cited by this paper
• Regular Expression Learning for Information Extraction

  2008cited by this paper
• Finite Automata, Digraph Connectivity, and Regular Expression Size

  2008cited by this paper
• A Formal Study Of Practical Regular Expressions

  2003cited by this paper
• Parameterized Complexity

  1998cited by this paper
• A regular-expression matcher

  1994cited by this paper
• On the Degree of Ambiguity of Finite Automata

  1991influential reference
• Introduction to the theory of computation

  1989cited by this paper
• Finding Patterns Common to a Set of Strings

  1980cited by this paper
• Complexity measures for regular expressions

  1974cited by this paper
• Ambiguity in Graphs and Expressions

  1971cited by this paper
• Parsing Algorithms with Backtrack

  1970cited by this paper
• Programming Techniques: Regular expression search algorithm

  1968cited by this paper

• Hardness of Regular Expression Matching with Extensions

  2026cites this paper