Tree automata with equality constraints modulo equational theories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4130 LNAI, Issue , 2006, Pages 557-571

  Jacquemard, Florent ^a   Rusinowitch, Michael ^b   Vigneron, Laurent ^b  

^a CNRS   (France)

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; CONSTRAINT THEORY; DIFFERENCE EQUATIONS; PROBLEM SOLVING; TREES (MATHEMATICS);

EQUALITY CONSTRAINTS; MODULO EQUATIONAL THEORIES; PARAMODULATION STRATEGIES; TREE AUTOMATA;

AUTOMATA THEORY;

EID: 33749583378     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_45     Document Type: Conference Paper

References (25)

1. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 104-115, 2001.
2. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic Paramodulation. Information and Computation, 121(2):172-192, 1995.
3. B. Bogaert and S. Tison. Equality and Disequality Constraints on Direct Subterms in Tree Automata. In 9th Symp. on Theoretical Aspects of Computer Science, STAGS, volume 577 of LNCS, pages 161-171. Springer, 1992.
4. J. A. Bull and D. J. Otway. The authentication protocol. Technical report, Defence Research Agency, Malvern, UK, 1997.
5. A.-C. Caron, H. Comon, J.-L. Coquidé, M. Dauchet, and F. Jacquemard. Pumping, Cleaning and Symbolic Constraints Solving. In 21st Int. Coll. on Automata, Languages and Programming, ICALP, volume 820 of LNCS, pages 436-449. Springer, 1994.
6. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. http://www.grappa. univ-lille3.fr/tata, 1997.
7. M. Dauchet, A.-C. Caron, and J.-L. Coquidé. Automata for Reduction Properties Solving. Journal of Symbolic Computation, 20(2):215-233, 1995.
8. D. E. Denning and G. M. Sacco. Timestamps in Key Distribution Protocols. In Communications of the ACM, 1981.
9. N. Dershowitz and J.-P. Jouannaud. Rewrite systems, chapter Handbook of Theoretical Computer Science, Volume B, pages 243-320. Elsevier, 1990.
10. P. Devienne, J.-M. Talbot, and S. Tison. Set-based analysis for logic programming and tree automata. In P. V, Hentenryck, editor, Static Analysis, 4th International Symposium, SAS, volume 1302 of Lecture Notes in Computer Science, pages 127-140. Springer, 1997.
11. T. Frühwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic programs as types for logic programs. In Proc. of the 6th IEEE Symposium on Logic in Computer Science, pages 300-309, 1991.
12. T. Genet and F. Klay. Rewriting for Cryptographic Protocol Verification. In Proc. of 17th Int. Conf. on Automated Deduction, CADE, volume 1831 of LNCS. Springer, 2000.
13. 1 by Resolution. Information Processing Letters, 95(3):401-408, 2005.
14. F. Jacquemard, C. Meyer, and C. Weidenbach. Unification in Extensions of Shallow Equational Theories. In 9th Int. Conf. on Rewriting Techniques and Applications, RTA, volume 1379 of LNCS, pages 76-90. Springer, 1998.
15. F. Jacquemard, M. Rusinowitch, and L. Vigneron. Tree automata with equality constraints modulo equational theories. Technical Report LSV-06-07, LSV, 2006. http://www.lsv.ens-cachan.fr/Publis.
16. R. Küsters and T. Wilke. Automata-Based Analysis of Recursive Cryptographic Protocols. In 21st Annual Symp. on Theoretical Aspects of Computer Science, STAGS, volume 2996 of LNCS, pages 382-393. Springer, 2004.
17. C. Lynch and C. Meadows. On the relative soundness of the free algebra model for public key encryption. Electr. Notes Theor. Comput. Sci., 125(1):43-54, 2005.
18. F. Nielson, H. Riis Nielson, and H. Seidl. Norrnalizable Horn Clauses, Strongly Recognizable Relations, and Spi. In Static Analysis, 9th Int. Syrnp., SAS, volume 2477 of LNCS, pages 20-35. Springer, 2002.
19. R. Nieuwenhuis and A. Rubio. Pararnodulation-Based Theorem Proving, chapter Handbook of Automated Reasoning, Volume I, Chapter 7. Elsevier Science and MIT Press, 2001.
20. H. Ohsaki and T. Takai. Decidability and Closure Properties of Equational Tree Languages. In 13th Int. Conf. on Rewriting Techniques and Applications, RTA, volume 2378 of LNCS, pages 114-128. Springer, 2002.
21. A. Riazanov and A. Voronkov. Splitting Without Backtracking. In Proc. of the 17th Int. Joint Conf. on Artificial Intelligence, IJCAI, pages 611-617. Morgan Kaufmann, 2001.
22. H. Seki, T. Takai, Y. Fujinaka, and Y. Kaji. Layered Transducing Term Rewriting System and Its Recognizability Preserving Property. In Int. Conf. on Rewriting Techniques and Applications, RTA, volume 2378 of LNCS, pages 98-113. Springer, 2002.
23. S. Tison. Tree automata and term rewrite systems. Invited tutorial at the 11th Int. Conf. on Rewriting Techniques and Applications, RTA, 2000.
24. T. Truderung. Selecting theories and recursive protocols. In M. Abadi and L. de Alfaro, editors, CONCUR, volume 3653 of Lecture Notes in Computer Science, pages 217-232. Springer, 2005.
25. K. N. Verma. Two-Way Equational Tree Automata. PhD thesis, ENS Cachan, Sept. 2003.