Tree Automata with Equality Constraints Modulo Equational Theories

  • Florent Jacquemard
  • Michael Rusinowitch
  • Laurent Vigneron
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4130)


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.


Equational Theory Authentication Protocol Predicate Symbol Horn Clause Ground Term 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Florent Jacquemard
    • 1
  • Michael Rusinowitch
    • 2
  • Laurent Vigneron
    • 3
  1. 1.INRIA Futurs & LSV, UMR 8643 
  2. 2.LORIA & INRIA Lorraine, UMR 7503 
  3. 3.LORIA & Univ. Nancy 2, UMR 7503 

Personalised recommendations