Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Completeness of Verifying Message Passing Programs under Bounded
  Asynchrony   We address the problem of verifying message passing programs, defined as a
set of parallel processes communicating through unbounded FIFO buffers. We
introduce a bounded analysis that explores a special type of computations,
called k-synchronous. These computations can be viewed as (unbounded) sequences
of interaction phases, each phase allowing at most k send actions (by different
processes), followed by a sequence of receives corresponding to sends in the
same phase. We give a procedure for deciding k-synchronizability of a program,
i.e., whether every computation is equivalent (has the same happens-before
relation) to one of its k-synchronous computations. We also show that
reachability over k-synchronous computations and checking k-synchronizability
are both PSPACE-complete. Furthermore, we introduce a class of programs called
{\em flow-bounded} for which the problem of deciding whether there exists a k>0
for which the program is k-synchronizable, is decidable.

28
The categories of this paper are: alg-geom
4
The categories of this paper are: cond-mat
18
The categories of this paper are: econ
19
The categories of this paper are: eess
30
The categories of this paper are: q-alg
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
31
The categories of this paper are: ao-sci
11
The categories of this paper are: hep-lat
35
The categories of this paper are: mtrl-th
33
The categories of this paper are: plasm-ph
6
The categories of this paper are: astro-ph
27
The categories of this paper are: comp-gas
10
The categories of this paper are: q-bio
37
The categories of this paper are: supr-con
16
The categories of this paper are: stat