Algorithmic complexity vulnerabilities occur when the worst-case time/space complexity of
an application is significantly higher than the respective average case for particular user …

Regular expression denial of service (ReDoS) is a class of algorithmic complexity attacks
where matching a regular expression against an attacker-provided input takes unexpectedly …

Regular expressions (regexes) are a popular and powerful means of automatically
manipulating text. Regexes are also an understudied denial of service vector (ReDoS). If a …

Regular expressions (regexes) are a powerful mechanism for solving string-matching
problems. They are supported by all modern programming languages, and have been …

This paper explores the extent to which regular expressions (regexes) are portable across
programming languages. Many languages offer similar regex syntaxes, and it would be …

Regular expression (regex) with modern extensions is one of the most popular string
processing tools. However, poorly-designed regexes can yield exponentially many matching …

Contemporary fuzz testing techniques focus on identifying memory corruption vulnerabilities
that allow adversaries to achieve either remote code execution or information disclosure …

Java is one of the preferred options of modern developers and has become increasingly
more prominent with the prevalence of the open-source culture. Thanks to the serialization …

Denial-of-Service (DoS) attacks are the bane of public-facing network deployments.
Algorithmic complexity attacks (ACAs) are a class of DoS attacks where an attacker uses a …

Regular expression Denial-of-Service (ReDoS) is a class of algorithmic complexity attacks.
Attackers can craft particular strings to trigger the worst-case super-linear matching time of …