Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Lazy TSO Reachability   We address the problem of checking state reachability for programs running
under Total Store Order (TSO). The problem has been shown to be decidable but
the cost is prohibitive, namely non-primitive recursive. We propose here to
give up completeness. Our contribution is a new algorithm for TSO reachability:
it uses the standard SC semantics and introduces the TSO semantics lazily and
only where needed. At the heart of our algorithm is an iterative refinement of
the program of interest. If the program's goal state is SC-reachable, we are
done. If the goal state is not SC-reachable, this may be due to the fact that
SC under-approximates TSO. We employ a second algorithm that determines TSO
computations which are infeasible under SC, and hence likely to lead to new
states. We enrich the program to emulate, under SC, these TSO computations.
Altogether, this yields an iterative under-approximation that we prove sound
and complete for bug hunting, i.e., a semi-decision procedure halting for
positive cases of reachability. We have implemented the procedure as an
extension to the tool Trencher and compared it to the Memorax and CBMC model
checkers.

17
The categories of this paper are: q-fin
19
The categories of this paper are: eess
14
The categories of this paper are: math-ph
34
The categories of this paper are: chem-ph
6
The categories of this paper are: astro-ph
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an
11
The categories of this paper are: hep-lat
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
3
The categories of this paper are: physics
30
The categories of this paper are: q-alg
7
The categories of this paper are: hep-th
28
The categories of this paper are: alg-geom
0
The categories of this paper are: hep-ph
32
The categories of this paper are: atom-ph