Journal of Computer and System Sciences
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
A structure to decide reachability in Petri nets
Theoretical Computer Science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Haskell overloading is DEXPTIME-complete
Information Processing Letters
Tree automata help one to solve equational formulae in AC-theories
Journal of Symbolic Computation
Tree automata and automated model building
Fundamenta Informaticae
Solving a unification problem under constrained substitutions using tree automata
Journal of Symbolic Computation
Handbook of formal languages, vol. 3
Journal of the ACM (JACM)
A Unification Algorithm for Associative-Commutative Functions
Journal of the ACM (JACM)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Well-structured transition systems everywhere!
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Counter machines and verification Problems
Theoretical Computer Science
A Method for Automatic Cryptographic Protocol Verification
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
A Good Class of Tree Automata and Application to Inductive Theorem Proving
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Set-Based Analysis of Reactive Infinite-State Systems
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Equality and Disequality Constraints on Direct Subterms in Tree Automata
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Feature Automata and Recognizable Sets of Feature Trees
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Decidability and Closure Properties of Equational Tree Languages
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Decidable Approximations of Sets of Descendants and Sets of Normal Forms
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Higher-Order Positive Set Constraints
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Associative-Commutative Unification
Proceedings of the 7th International Conference on Automated Deduction
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Rewriting for Cryptographic Protocol Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Vampire 1.1 (System Description)
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Handbook of automated reasoning
Handbook of automated reasoning
Combining superposition, sorts and splitting
Handbook of automated reasoning
Ground Reducibility is EXPTIME-complete
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Automata-driven automated induction
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The decidability of the reachability problem for vector addition systems (Preliminary Version)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Journal of Computer and System Sciences
Counting and equality constraints for multitree automata
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Two-way equational tree automata for AC-like theories: decidability and closure properties
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
On the complexity of equational horn clauses
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Automata and logics for unranked and unordered trees
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Alternation in equational tree automata modulo XOR
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
New directions in cryptography
IEEE Transactions on Information Theory
Combining Equational Tree Automata over AC and ACI Theories
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Tree Automata for Non-linear Arithmetic
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Rewriting systems for reachability in vector addition systems with pairs
RP'10 Proceedings of the 4th international conference on Reachability problems
Expand, enlarge, and check for branching vector addition systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryptographic protocol verification, in particular in modeling group key agreement schemes based on Diffie-Hellman-like functions, where the emptiness question for intersections of such automata is fundamental. This also has independent interest. We show that the use of general push clauses, or of alternation, leads to undecidability, already in the case of one AC symbol, with only functions of arity zero. On the other hand, emptiness is decidable in the general case of several function symbols, including several AC symbols, provided push clauses are unconditional and intersection clauses are final. This class of automata is also shown to be closed under intersection.