On the public citation graph

Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching

0 signed · 33 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.2001.3039openalex-snapshot
The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers,
inferredcites →https://doi.org/10.1007/978-3-540-85780-8_8openalex-snapshot
General Algorithms for Testing the Ambiguity of Finite Automata
inferredcites →https://doi.org/10.1007/978-3-642-38631-2_11openalex-snapshot
Static Analysis for Regular Expression Denial-of-Service Attacks
inferredcites →https://doi.org/10.1016/j.scico.2012.11.006openalex-snapshot
From regexes to parsing expression grammars
inferredcites →https://doi.org/10.1142/s012905410300214xopenalex-snapshot
A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.1145/363347.363387openalex-snapshot
Programming Techniques: Regular expression search algorithm
inferredcites →https://doi.org/10.1145/964001.964011openalex-snapshot
Parsing expression grammars

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.2436openalex-snapshot
Optimising unicode regular expression evaluation with previews
inferred← citeshttps://doi.org/10.1007/978-3-031-05578-2_9openalex-snapshot
On the Decidability of Infix Inclusion Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-07469-1_12openalex-snapshot
The Cut Operation in Subclasses of Convex Languages (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-031-07469-1_3openalex-snapshot
How to Settle the ReDoS Problem: Back to the Classical Automata Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-10363-6_6openalex-snapshot
Sound Static Analysis of Regular Expressions for Vulnerabilities to Denial of Service Attacks
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_4openalex-snapshot
Efficient Matching with Memoization for Regexes with Look-around and Atomic Grouping
inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_23openalex-snapshot
Benchmarking Regular Expression Matching
inferred← citeshttps://doi.org/10.1007/978-3-032-24839-8_3openalex-snapshot
LLM-Guided Fuzzing for Pathological Input Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-22360-5_24openalex-snapshot
On the Semantics of Regular Expression Parsing in the Wild
inferred← citeshttps://doi.org/10.1007/978-3-319-23111-2_4openalex-snapshot
Tight Bounds for Cut-Operations on Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-40946-7_27openalex-snapshot
Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
inferred← citeshttps://doi.org/10.1007/978-3-662-54580-5_1openalex-snapshot
Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions
inferred← citeshttps://doi.org/10.1007/s00224-023-10160-wopenalex-snapshot
On the Decidability of Infix Inclusion Problem
inferred← citeshttps://doi.org/10.1093/database/baad028openalex-snapshot
MantaID: a machine learning–based tool to automate the identification of biological database IDs
inferred← citeshttps://doi.org/10.1109/isie54533.2024.10595745openalex-snapshot
Software Evolution of I4.0 Digital Twins with Semantic Patching
inferred← citeshttps://doi.org/10.1109/sp40001.2021.00032openalex-snapshot
Using Selective Memoization to Defeat Regular Expression Denial of Service (ReDoS)
inferred← citeshttps://doi.org/10.1109/sp40001.2021.00062openalex-snapshot
Revealer: Detecting and Exploiting Regular Expression Denial-of-Service Vulnerabilities
inferred← citeshttps://doi.org/10.1145/3129416.3129440openalex-snapshot
Turning evil regexes harmless
inferred← citeshttps://doi.org/10.1145/3236024.3236027openalex-snapshot
The impact of regular expression denial of service (ReDoS) in practice: an empirical study at the ecosystem scale
inferred← citeshttps://doi.org/10.1145/3238147.3238159openalex-snapshot
ReScue: crafting regular expression DoS attacks
inferred← citeshttps://doi.org/10.1145/3498707openalex-snapshot
Solving string constraints with Regex-dependent functions through transducers with priorities and variables
inferred← citeshttps://doi.org/10.1145/3510003.3510047openalex-snapshot
Exploiting input sanitization for regex denial of service
inferred← citeshttps://doi.org/10.1145/3674666openalex-snapshot
A Coq Mechanization of JavaScript Regular Expression Semantics
inferred← citeshttps://doi.org/10.1145/3703595.3705884openalex-snapshot
Verified and Efficient Matching of Regular Expressions with Lookaround
inferred← citeshttps://doi.org/10.70675/2bff176azc66bz44abzb70dz6d0b5a89f876openalex-snapshot
Static Analysis for Security Properties of Software by Abstract Interpretation
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.