Handbook of theoretical computer science (vol. B)
Information and Computation
Automata for reduction properties solving
Journal of Symbolic Computation
Timestamps in key distribution protocols
Communications of the ACM
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pumping, Cleaning and Symbolic Constraints Solving
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Equality and Disequality Constraints on Direct Subterms in Tree Automata
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Set-Based Analysis for Logic Programming and Tree Automata
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Unification in Extension of Shallow Equational Theories
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Tree Automata and Term Rewrite Systems
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Decidability and Closure Properties of Equational Tree Languages
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Rewriting for Cryptographic Protocol Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Selecting theories and recursive protocols
CONCUR 2005 - Concurrency Theory
Splitting without backtracking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
On the Relative Soundness of the Free Algebra Model for Public Key Encryption
Electronic Notes in Theoretical Computer Science (ENTCS)
Information Processing Letters
Information Processing Letters
Combining Equational Tree Automata over AC and ACI Theories
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Superposition for Fixed Domains
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
TAGED Approximations for Temporal Properties Model-Checking
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Protocol verification via rigid/flexible resolution
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
On the completeness of context-sensitive order-sorted specifications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Superposition for fixed domains
ACM Transactions on Computational Logic (TOCL)
Automatic generation of invariants for circular derivations in SUP(LA)
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Unranked tree automata with sibling equalities and disequalities
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential for application in e.g. software verification. These tree automata are obtained by extending the standard Horn clause representations with equational conditions and rewrite systems. We show in particular that a generalized membership problem (extending the emptiness problem) is decidable by proving that the saturation of tree automata presentations with suitable paramodulation strategies terminates. Alternatively our results can be viewed as new decidable classes of first-order formula.