Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Static Detection of DoS Vulnerabilities in Programs that use Regular
  Expressions (Extended Version)   In an algorithmic complexity attack, a malicious party takes advantage of the
worst-case behavior of an algorithm to cause denial-of-service. A prominent
algorithmic complexity attack is regular expression denial-of-service (ReDoS),
in which the attacker exploits a vulnerable regular expression by providing a
carefully-crafted input string that triggers worst-case behavior of the
matching algorithm. This paper proposes a technique for automatically finding
ReDoS vulnerabilities in programs. Specifically, our approach automatically
identifies vulnerable regular expressions in the program and determines whether
an "evil" input string can be matched against a vulnerable regular expression.
We have implemented our proposed approach in a tool called REXPLOITER and found
41 exploitable security vulnerabilities in Java web applications.

35
The categories of this paper are: mtrl-th
4
The categories of this paper are: cond-mat
24
The categories of this paper are: dg-ga
16
The categories of this paper are: stat
6
The categories of this paper are: astro-ph
22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin
33
The categories of this paper are: plasm-ph
3
The categories of this paper are: physics
7
The categories of this paper are: hep-th
28
The categories of this paper are: alg-geom
14
The categories of this paper are: math-ph
20
The categories of this paper are: acc-phys
0
The categories of this paper are: hep-ph
23
The categories of this paper are: solv-int
9
The categories of this paper are: nlin