Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Concolic Unbounded-Thread Reachability via Loop Summaries (Extended
  Technical Report)   We present a method for accelerating explicit-state backward search
algorithms for systems of arbitrarily many finite-state threads. Our method
statically analyzes the program executed by the threads for the existence of
simple loops. We show how such loops can be collapsed without approximation
into Presburger arithmetic constraints that symbolically summarize the effect
of executing the backward search algorithm along the loop in the multi-threaded
program. As a result, the subsequent explicit-state search does not need to
explore the summarized part of the state space. The combination of concrete and
symbolic exploration gives our algorithm a concolic flavor. We demonstrate the
power of this method for proving and refuting safety properties of
unbounded-thread programs.

6
The categories of this paper are: astro-ph
37
The categories of this paper are: supr-con
25
The categories of this paper are: patt-sol
31
The categories of this paper are: ao-sci
11
The categories of this paper are: hep-lat
0
The categories of this paper are: hep-ph
34
The categories of this paper are: chem-ph
30
The categories of this paper are: q-alg
20
The categories of this paper are: acc-phys
23
The categories of this paper are: solv-int
9
The categories of this paper are: nlin
10
The categories of this paper are: q-bio
4
The categories of this paper are: cond-mat
14
The categories of this paper are: math-ph
27
The categories of this paper are: comp-gas
7
The categories of this paper are: hep-th