Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: String Theories involving Regular Membership Predicates: From Practice
  to Theory and Back   Widespread use of string solvers in formal analysis of string-heavy programs
has led to a growing demand for more efficient and reliable techniques which
can be applied in this context, especially for real-world cases. Designing an
algorithm for the (generally undecidable) satisfiability problem for systems of
string constraints requires a thorough understanding of the structure of
constraints present in the targeted cases. In this paper, we investigate
benchmarks presented in the literature containing regular expression membership
predicates, extract different first order logic theories, and prove their
decidability, resp. undecidability. Notably, the most common theories in
real-world benchmarks are PSPACE-complete and directly lead to the
implementation of a more efficient algorithm to solving string constraints.

20
The categories of this paper are: acc-phys
10
The categories of this paper are: q-bio
11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
9
The categories of this paper are: nlin
7
The categories of this paper are: hep-th
29
The categories of this paper are: funct-an
6
The categories of this paper are: astro-ph
30
The categories of this paper are: q-alg
22
The categories of this paper are: chao-dyn
2
The categories of this paper are: math
28
The categories of this paper are: alg-geom
35
The categories of this paper are: mtrl-th
19
The categories of this paper are: eess