Tree automata with equality constraints modulo equational theories

Journal of Logic and Algebraic Programming

Volumn 75, Issue 2, 2008, Pages 182-208

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

^a INRIA   (France)

^b LORIA   (France)

Author keywords

Basic paramodulation; First order theorem proving; Splitting; Tree automata; Verification of infinite state systems

Indexed keywords

AUTOMATA THEORY; CONSTRAINT THEORY; TREES (MATHEMATICS); VERIFICATION;

FIRST ORDER THEOREM PROVING; TREE AUTOMATA; VERIFICATION OF INFINITE STATE SYSTEMS;

THEOREM PROVING;

EID: 40849086287     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2007.10.006     Document Type: Article

References (26)

1. M. Abadi, C. Fournet, Mobile values, new names, and secure communication, in: 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2001.
2. Bachmair L., Ganzinger H., Lynch C., and Snyder W. Basic paramodulation. Inform. Comput. 121 2 (1995) 172-192
3. Bogaert B., and Tison S. Equality and disequality constraints on direct subterms in tree automata. 9th Symp. on Theoretical Aspects of Computer Science, STACS. LNCS vol. 577 (1992), Springer
4. J.A. Bull, D.J. Otway, The authentication protocol, Tech. Rep., Defence Research Agency, Malvern, UK, 1997.
5. Caron A.-C., Comon H., Coquidé J.-L., Dauchet M., and Jacquemard F. Pumping, cleaning and symbolic constraints solving. 21st Int. Coll. on Automata, Languages and Programming, ICALP. LNCS vol. 820 (1994), Springer
6. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, M. Tommasi, Tree Automata Techniques and Applications, 1997, .
7. Dauchet M., Caron A.-C., and Coquidé J.-L. Automata for reduction properties solving. J. Symbolic Comput. 20 2 (1995) 215-233
8. Denning D.E., and Sacco G.M. Timestamps in key distribution protocols. Commun. ACM (1981)
9. Dershowitz N., and Jouannaud J.-P. Rewrite systems. Handbook of Theoretical Computer Science vol. B (1990), Elsevier pp. 243-320
10. Devienne P., Talbot J.-M., and Tison S. Set-based analysis for logic programming and tree automata. In: Hentenryck P.V. (Ed). Static Analysis, 4th International Symposium, SAS. Lecture Notes in Computer Science vol. 1302 (1997), Springer
11. T. Frühwirth, E. Shapiro, M. Vardi, E. Yardeni, Logic programs as types for logic programs, in: Proc. of the 6th IEEE Symposium on Logic in Computer Science, 1991.
12. Genet T., and Klay F. Rewriting for cryptographic protocol verification. Proc. of 17th Int. Conf. on Automated Deduction, CADE. LNCS vol. 1831 (2000), Springer
13. 1 by resolution. Inform. Process. Lett. 95 3 (2005) 401-408
14. Jacquemard F., Meyer C., and Weidenbach C. Unification in extensions of shallow equational theories. 9th Int. Conf. on Rewriting Techniques and Applications, RTA. LNCS vol. 1379 (1998), Springer
15. Jacquemard F., Rusinowitch M., and Vigneron L. Tree automata with equality constraints modulo equational theories. In: Furbach U., and Shankar N. (Eds). Proceedings of 3rd International Joint Conference on Automated Reasoning, IJCAR. Lecture Notes in Artificial Intelligence vol. 4130 (2006), Springer, Seattle, WA
16. Küsters R., and Wilke T. Automata-based analysis of recursive cryptographic protocols. 21st Annual Symp. on Theoretical Aspects of Computer Science, STACS. LNCS vol. 2996 (2004), Springer
17. Lynch C., and Meadows C. On the relative soundness of the free algebra model for public key encryption. Electr. Notes Theor. Comput. Sci. 125 1 (2005) 43-54
18. Nielson F., Riis Nielson H., and Seidl H. Normalizable Horn Clauses, strongly recognizable relations, and Spi. Static Analysis, 9th Int. Symp., SAS. LNCS vol. 2477 (2002), Springer
19. Nieuwenhuis R., and Rubio A. Paramodulation-based theorem proving. Handbook of Automated Reasoning vol. I (2001), Elsevier Science and MIT Press 371-443 (Chapter 7)
20. Ohsaki H., and Takai T. Decidability and closure properties of equational tree languages. 13th Int. Conf. on Rewriting Techniques and Applications, RTA. LNCS vol. 2378 (2002), Springer
21. Riazanov A., and Voronkov A. Splitting without backtracking. Proc. of the 17th Int. Joint Conf. on Artificial Intelligence, IJCAI (2001), Morgan Kaufmann
22. Seidl H. Haskell overloading is dexptime-complete. Inform. Process. Lett. 52 2 (1994) 57-60
23. Seki H., Takai T., Fujinaka Y., and Kaji Y. Layered transducing term rewriting system and its recognizability preserving property. Int. Conf. on Rewriting Techniques and Applications, RTA. LNCS vol. 2378 (2002), Springer
24. S. Tison, Tree automata and term rewrite systems, Invited Tutorial at the 11th Int. Conf. on Rewriting Techniques and Applications, RTA, 2000.
25. Truderung T. Selecting theories and recursive protocols. In: Abadi M., and de Alfaro L. (Eds). CONCUR. Lecture Notes in Computer Science vol. 3653 (2005), Springer
26. K.N. Verma, Two-way equational tree automata, Ph.D. thesis, ENS Cachan, September 2003.