Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Symbolic Decision Procedure for Symbolic Alternating Finite Automata   We introduce Symbolic Alternating Finite Automata (s-AFA) as an expressive,
succinct, and decidable model for describing sets of finite sequences over
arbitrary alphabets. Boolean operations over s-AFAs have linear complexity,
which is in sharp contrast with the quadratic cost of intersection and union
for non-alternating symbolic automata. Due to this succinctness, emptiness and
equivalence checking are PSpace-hard.
  We introduce an algorithm for checking the equivalence of two s-AFAs based on
bisimulation up to congruence. This algorithm allows us to exploit the power of
SAT and SMT solvers to efficiently search the state space of the s-AFAs. We
evaluate our decision procedure on two verification and security applications:
1) checking satisfiability of linear temporal logic formulas over finite
traces, and 2) checking equivalence of Boolean combinations of regular
expressions. Our experiments show that our technique often outperforms existing
techniques and it can be beneficial in both such applications.

30
The categories of this paper are: q-alg
21
The categories of this paper are: adap-org
11
The categories of this paper are: hep-lat
13
The categories of this paper are: quant-ph
0
The categories of this paper are: hep-ph
10
The categories of this paper are: q-bio
5
The categories of this paper are: gr-qc
14
The categories of this paper are: math-ph
6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom
19
The categories of this paper are: eess
16
The categories of this paper are: stat
23
The categories of this paper are: solv-int