On the public citation graph

Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics

https://doi.org/10.1145/3591262
0 signed · 50 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.1007/3-540-59042-0_96openalex-snapshot
Partial derivatives of regular expressions and finite automata constructions
inferredcites →https://doi.org/10.1007/978-3-030-17462-0_24openalex-snapshot
Symbolic Regex Matcher
inferredcites →https://doi.org/10.1007/978-3-319-24246-0_9openalex-snapshot
A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings
inferredcites →https://doi.org/10.1007/978-3-319-43144-4_5openalex-snapshot
POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_53openalex-snapshot
Greedy Regular Expression Matching
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-18275-4_18openalex-snapshot
An Evaluation of Automata Algorithms for String Analysis
inferredcites →https://doi.org/10.1016/j.tcs.2021.01.010openalex-snapshot
Formalising and implementing Boost POSIX regular expression matching
inferredcites →https://doi.org/10.1017/s0956796808007090openalex-snapshot
Regular-expression derivatives re-examined
inferredcites →https://doi.org/10.1070/rm1961v016n05abeh004112openalex-snapshot
THE ABSTRACT THEORY OF AUTOMATA
inferredcites →https://doi.org/10.1109/spire.2000.878194openalex-snapshot
NFAs with tagged transitions, their conversion to deterministic automata and application to regular expressions
inferredcites →https://doi.org/10.1145/176454.176484openalex-snapshot
An efficient representation for sparse sets
inferredcites →https://doi.org/10.1145/1863543.1863594openalex-snapshot
A play on regular expressions
inferredcites →https://doi.org/10.1145/2370776.2370788openalex-snapshot
Regular expression sub-matching using partial derivatives
inferredcites →https://doi.org/10.1145/2535838.2535849openalex-snapshot
Minimization of symbolic automata
inferredcites →https://doi.org/10.1145/256167.256195openalex-snapshot
Kleene algebra with tests
inferredcites →https://doi.org/10.1145/2775051.2677007openalex-snapshot
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests
inferredcites →https://doi.org/10.1145/321239.321249openalex-snapshot
Derivatives of Regular Expressions
inferredcites →https://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
inferredcites →https://doi.org/10.1145/3314221.3314645openalex-snapshot
Sound regular expression semantics for dynamic symbolic execution of JavaScript
inferredcites →https://doi.org/10.1145/3338906.3342509openalex-snapshot
Rethinking Regex engines to address ReDoS
inferredcites →https://doi.org/10.1145/3428286openalex-snapshot
Regex matching with counting-set automata
inferredcites →https://doi.org/10.1145/3453483.3454066openalex-snapshot
Symbolic Boolean derivatives for efficiently solving extended regular expression constraints
inferredcites →https://doi.org/10.1145/363347.363387openalex-snapshot
Programming Techniques: Regular expression search algorithm
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.18653/v1/d18-1547openalex-snapshot
MultiWOZ - A Large-Scale Multi-Domain Wizard-of-Oz Dataset for Task-Oriented Dialogue Modelling
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2014.175openalex-snapshot
Symbolic Solving of Extended Regular Expression Inequalities
inferredcites →https://doi.org/10.48550/arxiv.1907.13577openalex-snapshot
Regular languages, derivatives and finite automata
inferredcites →https://doi.org/10.5281/zenodo.7709499openalex-snapshot
Artifact for "Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics"

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
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-65627-9_3openalex-snapshot
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_7openalex-snapshot
Regex Decision Procedures in Extended RE#
inferred← citeshttps://doi.org/10.1007/s10817-023-09667-1openalex-snapshot
POSIX Lexing with Derivatives of Regular Expressions
inferred← citeshttps://doi.org/10.1016/j.scico.2026.103510openalex-snapshot
Effective methods for solving regex crossword puzzles
inferred← citeshttps://doi.org/10.1109/access.2026.3725911openalex-snapshot
ZDPI: Zero-Copy Deep Packet Inspection via Compressed Finite State Automata in eBPF/XDP With BPF Arena
inferred← citeshttps://doi.org/10.1109/cgo57630.2024.10444810openalex-snapshot
One Automaton to Rule Them All: Beyond Multiple Regular Expressions Execution
inferred← citeshttps://doi.org/10.1145/3632907openalex-snapshot
Parikh’s Theorem Made Symbolic
inferred← citeshttps://doi.org/10.1145/3632934openalex-snapshot
Efficient Matching of Regular Expressions with Lookaround Assertions
inferred← citeshttps://doi.org/10.1145/3636501.3636959openalex-snapshot
Lean Formalization of Extended Regular Expression Matching with Lookarounds
inferred← citeshttps://doi.org/10.1145/3656431openalex-snapshot
Linear Matching of JavaScript Regular Expressions
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.1145/3704837openalex-snapshot
RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement, and Restricted Lookarounds
inferred← citeshttps://doi.org/10.1145/3704838openalex-snapshot
Symbolic Automata: Omega-Regularity Modulo Theories
inferred← citeshttps://doi.org/10.1145/3708821.3733912openalex-snapshot
SoK: A Literature and Engineering Review of Regular Expression Denial of Service (ReDoS)
inferred← citeshttps://doi.org/10.1145/3747517openalex-snapshot
Polynomial-Time Program Equivalence for Machine Knitting
inferred← citeshttps://doi.org/10.1145/3776710openalex-snapshot
Formal Verification for JavaScript Regular Expressions: A Proven Mechanized Semantics and Its Applications
inferred← citeshttps://doi.org/10.1145/3849378openalex-snapshot
Symbolic Derivatives: Regularity and �-Regularity Modulo Theories
inferred← citeshttps://doi.org/10.29007/fgz5openalex-snapshot
On Symbolic Derivatives and Transition Regexes
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.