Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Precise Complexity Guarantees for Pointer Analysis via Datalog with
  Extensions   Pointer analysis is a fundamental static program analysis for computing the
set of objects that an expression can refer to. Decades of research has gone
into developing methods of varying precision and efficiency for pointer
analysis for programs that use different language features, but determining
precisely how efficient a particular method is has been a challenge in itself.
  For programs that use different language features, we consider methods for
pointer analysis using Datalog and extensions to Datalog. When the rules are in
Datalog, we present the calculation of precise time complexities from the rules
using a new algorithm for decomposing rules for obtaining the best
complexities. When extensions such as function symbols and universal
quantification are used, we describe algorithms for efficiently implementing
the extensions and the complexities of the algorithms.
  This paper is under consideration for acceptance in TPLP.

23
The categories of this paper are: solv-int
28
The categories of this paper are: alg-geom
14
The categories of this paper are: math-ph
6
The categories of this paper are: astro-ph
33
The categories of this paper are: plasm-ph
7
The categories of this paper are: hep-th
2
The categories of this paper are: math
34
The categories of this paper are: chem-ph
0
The categories of this paper are: hep-ph
15
The categories of this paper are: nucl-ex
37
The categories of this paper are: supr-con
17
The categories of this paper are: q-fin
9
The categories of this paper are: nlin
13
The categories of this paper are: quant-ph
21
The categories of this paper are: adap-org
25
The categories of this paper are: patt-sol