Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
Haskell overloading is DEXPTIME-complete
Information Processing Letters
Automata for reduction properties solving
Journal of Symbolic Computation
Theorem Proving via General Matings
Journal of the ACM (JACM)
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Equality and Disequality Constraints on Direct Subterms in Tree Automata
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
On Name Generation and Set-Based Analysis in the Dolev-Yao Model
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Rewriting for Cryptographic Protocol Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Security properties: two agents are sufficient
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Tree automata with one memory set constraints and cryptographic protocols
Theoretical Computer Science - Automata, languages and programming
Visibly Pushdown Languages and Term Rewriting
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Tree Automata with Global Constraints
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Closure properties and decision problems of dag automata
Information Processing Letters
Information Processing Letters
Information Processing Letters
Protocol verification via rigid/flexible resolution
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
The Emptiness Problem for Tree Automata with Global Constraints
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
On computing reachability sets of process rewrite systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Satisfiability of a spatial logic with tree variables
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Tree automata, (dis-)equality constraints and term rewriting: what's new?
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Applying tree languages in proof theory
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Project presentation: algorithmic structuring and compression of proofs (ASCOP)
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
On positive TAGED with a bounded number of constraints
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints
Journal of Automated Reasoning
Hi-index | 0.00 |
We introduce the class of rigid tree automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a restriction on the computation of RTA on trees: RTA can test for equality in subtrees reaching the same rigid state. RTA are able to perform local and global tests of equality between subtrees, non-linear tree pattern matching, and some inequality and disequality tests as well. Properties like determinism, pumping lemma, Boolean closure, and several decision problems are studied in detail. In particular, the emptiness problem is shown decidable in linear time for RTA whereas membership of a given tree to the language of a given RTA is NP-complete. Our main result is the decidability of whether a given tree belongs to the rewrite closure of an RTA language under a restricted family of term rewriting systems, whereas this closure is not an RTA language. This result, one of the first on rewrite closure of languages of tree automata with constraints, is enabling the extension of model checking procedures based on finite tree automata techniques, in particular for the verification of communicating processes with several local non-rewritable memories, like security protocols. Finally, a comparison of RTA with several classes of tree automata with local and global equality tests, with dag automata and Horn clause formalisms is also provided.