Talk:ReDoS

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computing / Security (Rated C-class, Low-importance)
WikiProject icon This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
C-Class article C  This article has been rated as C-Class on the project's quality scale.
 Low  This article has been rated as Low-importance on the project's importance scale.
Taskforce icon
This article is supported by WikiProject Computer Security.
 

just look how it is written! thats not wiki standard! — Preceding unsigned comment added by 79.201.163.93 (talkcontribs) 09:43, 19 July 2010

That's not very helpful, you know.
But really, this article looks much more like a how-to guide than an encyclopedia article.
- Gabrielkfl (talk) 01:06, 4 March 2011 (UTC)

Point out how some regular expression libraries allow the user to specify a timeout for the evaluation of the regex. For example, The .NET Framework 4.5 has that feature. — Preceding unsigned comment added by 76.102.37.19 (talk) 10:16, 22 March 2012 (UTC)

NFA vs. DFA[edit]

This article seems to assume all regex engines are NFA or hybrid NFA/DFA, but pure DFA engines do exists-- and they are not susceptible to this type of attack. Namely, non-GNU awk and non-gnu egrep use pure-DFA engines.[1] --Lucas.Yamanishi (talk) 21:05, 30 March 2013 (UTC)

Article Name[edit]

I think the article name is probably incorrect. “ReDoS” doesn't really seem to have a definition outside of this page, “Catastrophic Backtracking,” while it has fewer total results on a google search, at least seems to unambiguously mean this.

PiAndWhippedCream (talk) 19:32, 1 April 2014 (UTC)

  1. ^ Friedl, Jeffrey E. F. (2006). Andy Oram, ed. Mastering Regular Expressions (3rd ed.). 1005 Gravenstein Highway North, Sebastopol, CA 95472: O'Reilly Media, Inc. pp. 145–147. ISBN 978-0-596-52812-6.