Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Tree Width of Separation Logic with Recursive Definitions   Separation Logic is a widely used formalism for describing dynamically
allocated linked data structures, such as lists, trees, etc. The decidability
status of various fragments of the logic constitutes a long standing open
problem. Current results report on techniques to decide satisfiability and
validity of entailments for Separation Logic(s) over lists (possibly with
data). In this paper we establish a more general decidability result. We prove
that any Separation Logic formula using rather general recursively defined
predicates is decidable for satisfiability, and moreover, entailments between
such formulae are decidable for validity. These predicates are general enough
to define (doubly-) linked lists, trees, and structures more general than
trees, such as trees whose leaves are chained in a list. The decidability
proofs are by reduction to decidability of Monadic Second Order Logic on graphs
with bounded tree width.

2
The categories of this paper are: math
32
The categories of this paper are: atom-ph
17
The categories of this paper are: q-fin
11
The categories of this paper are: hep-lat
8
The categories of this paper are: hep-ex
0
The categories of this paper are: hep-ph
26
The categories of this paper are: bayes-an
6
The categories of this paper are: astro-ph
29
The categories of this paper are: funct-an
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
27
The categories of this paper are: comp-gas
16
The categories of this paper are: stat
3
The categories of this paper are: physics
12
The categories of this paper are: nucl-th
36
The categories of this paper are: cmp-lg