The equivalence problem of multitape finite automata
Theoretical Computer Science
New Decidability Results Concerning Two-Way Counter Machines
SIAM Journal on Computing
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
A Static Analysis Framework For Detecting SQL Injection Vulnerabilities
COMPSAC '07 Proceedings of the 31st Annual International Computer Software and Applications Conference - Volume 01
Abstracting Symbolic Execution with String Analysis
TAICPART-MUTATION '07 Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION
Symbolic String Verification: An Automata-Based Approach
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Symbolic String Verification: Combining String Analysis and Size Analysis
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Relational string verification using multi-track automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
| Hi-index | 5.23 |
Motivated by applications to verification problems in string manipulating programs, we look at the problem of whether the heads in a multi-tape automaton are synchronized. Given an n-tape pushdown automaton M with a one-way read-only head per tape and a right end marker $ on each tape, and an integer k=0, we say that M is k-synchronized if at any time during any computation of M on any input n-tuple (x"1,...,x"n) (whether or not it is accepted), no pair of input heads that are not on $ are more than k cells apart. This requirement is automatically satisfied if one of the heads has reached $. Note that an n-tuple (x"1,...,x"n) is accepted if M reaches the configuration where all n heads are on $ and M is in an accepting state. The automaton can be deterministic (DPDA) or nondeterministic (NPDA) and, in the special case, may not have a pushdown stack (DFA, NFA). We obtain decidability and undecidability results for these devices for both one-way and two-way versions. We also consider the notion of k-synchronized one-way and two-way multi-head automata and investigate similar problems.