On the public citation graph

RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement, and Restricted Lookarounds

0 signed · 53 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-030-99524-9_24openalex-snapshot
cvc5: A Versatile and Industrial-Strength SMT Solver
inferredcites →https://doi.org/10.1007/978-3-031-30829-1_19openalex-snapshot
Fast Matching of Regular Patterns with Synchronizing Counting
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-00982-2_24openalex-snapshot
On Extended Regular Expressions
inferredcites →https://doi.org/10.1007/978-3-642-21254-3_13openalex-snapshot
Partial Derivatives of an Extended Regular Expression
inferredcites →https://doi.org/10.1007/s10817-023-09667-1openalex-snapshot
POSIX Lexing with Derivatives of Regular Expressions
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.1109/tec.1960.5221603openalex-snapshot
Regular Expressions and State Graphs for Automata
inferredcites →https://doi.org/10.1145/1863543.1863594openalex-snapshot
A play on regular expressions
inferredcites →https://doi.org/10.1145/2071368.2071372openalex-snapshot
Succinctness of the Complement and Intersection of Regular Expressions
inferredcites →https://doi.org/10.1145/2370776.2370788openalex-snapshot
Regular expression sub-matching using partial derivatives
inferredcites →https://doi.org/10.1145/256167.256195openalex-snapshot
Kleene algebra with tests
inferredcites →https://doi.org/10.1145/2837614.2837647openalex-snapshot
Kleenex: compiling nondeterministic transducers to deterministic streaming transducers
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/3419404openalex-snapshot
Automata modulo theories
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/3472456.3473512openalex-snapshot
Teddy: An Efficient SIMD-based Literal Matching Engine for Scalable Deep Packet Inspection
inferredcites →https://doi.org/10.1145/3498707openalex-snapshot
Solving string constraints with Regex-dependent functions through transducers with priorities and variables
inferredcites →https://doi.org/10.1145/3586044openalex-snapshot
Regular Expression Matching using Bit Vector Automata
inferredcites →https://doi.org/10.1145/3591262openalex-snapshot
Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics
inferredcites →https://doi.org/10.1145/3632934openalex-snapshot
Efficient Matching of Regular Expressions with Lookaround Assertions
inferredcites →https://doi.org/10.1145/363347.363387openalex-snapshot
Programming Techniques: Regular expression search algorithm
inferredcites →https://doi.org/10.1145/3636501.3636959openalex-snapshot
Lean Formalization of Extended Regular Expression Matching with Lookarounds
inferredcites →https://doi.org/10.1145/3656431openalex-snapshot
Linear Matching of JavaScript Regular Expressions
inferredcites →https://doi.org/10.1587/transinf.2022edp7098openalex-snapshot
On Lookaheads in Regular Expressions with Backreferences
inferredcites →https://doi.org/10.2197/ipsjjip.27.422openalex-snapshot
Derivatives of Regular Expressions with Lookahead
inferredcites →https://doi.org/10.3897/jucs.66330openalex-snapshot
Regular Expressions with Lookahead
inferredcites →https://doi.org/10.4230/lipics.itp.2023.27openalex-snapshot
POSIX Lexing with Bitcoded Derivatives
inferredcites →https://doi.org/10.48550/arxiv.2309.14401openalex-snapshot
Derivative Based Extended Regular Expression Matching Supporting Intersection, Complement and Lookarounds
inferredcites →https://doi.org/10.48550/arxiv.2608.03167openalex-snapshot
Translation of Regular Expression with Lookahead into Finite State Automaton
inferredcites →https://doi.org/10.5281/zenodo.13926626openalex-snapshot
Artifact for "RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement and Restricted Lookarounds"

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-98682-6_7openalex-snapshot
Regex Decision Procedures in Extended RE#
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_17openalex-snapshot
On Complementation of Nondeterministic Finite Automata Without Full Determinization
inferred← citeshttps://doi.org/10.1038/s41598-026-49727-1openalex-snapshot
From LLMs to AI agents: a systematic benchmark for SAO structure extraction in patent analytics
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/3729300openalex-snapshot
Membership Testing for Semantic Regular Expressions
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/3808281openalex-snapshot
Towards Efficient Matching of Regexes with Backreferences using Register Set Automata
inferred← citeshttps://doi.org/10.1145/3832783.3837475openalex-snapshot
LARA: Static ReDoS Detection for Regular Expressions with Lookahead via Matching Automata
inferred← citeshttps://doi.org/10.1145/3849378openalex-snapshot
Symbolic Derivatives: Regularity and �-Regularity Modulo Theories
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.