Pages that link to "Item:Q2830233"
From MaRDI portal
The following pages link to Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA (Q2830233):
Displaying 9 items.
- Memoized regular expressions (Q2117661) (← links)
- How to settle the ReDoS problem: back to the classical automata theory (Q2164733) (← links)
- Formalising and implementing Boost POSIX regular expression matching (Q2220787) (← links)
- On the semantics of regular expression parsing in the wild (Q2357106) (← links)
- On the semantics of atomic subgroups in practical regular expressions (Q2399246) (← links)
- Re-examining regular expressions with backreferences (Q2699953) (← links)
- Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security (Q2798768) (← links)
- Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions (Q3303917) (← links)
- Benchmarking regular expression matching (Q6666809) (← links)