{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T06:40:04Z","timestamp":1736577604559,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540371878"},{"type":"electronic","value":"9783540371885"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11814771_45","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T15:44:21Z","timestamp":1160063061000},"page":"557-571","source":"Crossref","is-referenced-by-count":13,"title":["Tree Automata with Equality Constraints Modulo Equational Theories"],"prefix":"10.1007","author":[{"given":"Florent","family":"Jacquemard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Rusinowitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Vigneron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 104\u2013115 (2001)","DOI":"10.1145\/360204.360213"},{"issue":"2","key":"45_CR2","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/inco.1995.1131","volume":"121","author":"L. Bachmair","year":"1995","unstructured":"Bachmair, L., Ganzinger, H., Lynch, C., Snyder, W.: Basic Paramodulation. Information and Computation\u00a0121(2), 172\u2013192 (1995)","journal-title":"Information and Computation"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","first-page":"161","volume-title":"STACS 92","author":"B. Bogaert","year":"1992","unstructured":"Bogaert, B., Tison, S.: Equality and Disequality Constraints on Direct Subterms in Tree Automata. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 161\u2013171. Springer, Heidelberg (1992)"},{"key":"45_CR4","unstructured":"Bull, J.A., Otway, D.J.: The authentication protocol. Technical report, Defence Research Agency, Malvern, UK (1997)"},{"key":"45_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/3-540-58201-0_88","volume-title":"Automata, Languages, and Programming","author":"A.-C. Caron","year":"1994","unstructured":"Caron, A.-C., Comon, H., Coquid\u00e9, J.-L., Dauchet, M., Jacquemard, F.: Pumping, Cleaning and Symbolic Constraints Solving. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 436\u2013449. Springer, Heidelberg (1994)"},{"key":"45_CR6","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1997), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"2","key":"45_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1006\/jsco.1995.1048","volume":"20","author":"M. Dauchet","year":"1995","unstructured":"Dauchet, M., Caron, A.-C., Coquid\u00e9, J.-L.: Automata for Reduction Properties Solving. Journal of Symbolic Computation\u00a020(2), 215\u2013233 (1995)","journal-title":"Journal of Symbolic Computation"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Denning, D.E., Sacco, G.M.: Timestamps in Key Distribution Protocols. In: Communications of the ACM (1981)","DOI":"10.1145\/358722.358740"},{"key":"45_CR9","first-page":"243","volume-title":"Rewrite systems","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Handbook of Theoretical Computer Science. In: Rewrite systems, vol.\u00a0B, pp. 243\u2013320. Elsevier, Amsterdam (1990)"},{"key":"45_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0032738","volume-title":"Static Analysis","author":"P. Devienne","year":"1997","unstructured":"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.\u00a01302, pp. 127\u2013140. Springer, Heidelberg (1997)"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, 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\u2013309 (1991)","DOI":"10.1109\/LICS.1991.151654"},{"key":"45_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10721959_21","volume-title":"Automated Deduction - CADE-17","author":"T. Genet","year":"2000","unstructured":"Genet, T., Klay, F.: Rewriting for Cryptographic Protocol Verification. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, Springer, Heidelberg (2000)"},{"issue":"3","key":"45_CR13","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ipl.2005.04.007","volume":"95","author":"J. Goubault-Larrecq","year":"2005","unstructured":"Goubault-Larrecq, J.: Deciding $\\mathcal{\\MakeUppercase{H}}_1$ by Resolution. Information Processing Letters\u00a095(3), 401\u2013408 (2005)","journal-title":"Information Processing Letters"},{"key":"45_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BFb0052362","volume-title":"Rewriting Techniques and Applications","author":"F. Jacquemard","year":"1998","unstructured":"Jacquemard, F., Meyer, C., Weidenbach, C.: Unification in Extensions of Shallow Equational Theories. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol.\u00a01379, pp. 76\u201390. Springer, Heidelberg (1998)"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Jacquemard, F., Rusinowitch, M., Vigneron, L.: Tree automata with equality constraints modulo equational theories. Technical Report LSV-06-07, LSV (2006), http:\/\/www.lsv.ens-cachan.fr\/Publis","DOI":"10.1007\/11814771_45"},{"key":"45_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-24749-4_34","volume-title":"STACS 2004","author":"R. K\u00fcsters","year":"2004","unstructured":"K\u00fcsters, R., Wilke, T.: Automata-Based Analysis of Recursive Cryptographic Protocols. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 382\u2013393. Springer, Heidelberg (2004)"},{"issue":"1","key":"45_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.entcs.2004.05.018","volume":"125","author":"C. Lynch","year":"2005","unstructured":"Lynch, C., Meadows, C.: On the relative soundness of the free algebra model for public key encryption. Electr. Notes Theor. Comput. Sci.\u00a0125(1), 43\u201354 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"45_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-45789-5_5","volume-title":"Static Analysis","author":"F. Nielson","year":"2002","unstructured":"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.\u00a02477, pp. 20\u201335. Springer, Heidelberg (2002)"},{"key":"45_CR19","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R., Rubio, A.: Handbook of Automated Reasoning, ch. 7. In: Nieuwenhuis, R., Rubio, A. (eds.) Paramodulation-Based Theorem Proving, vol.\u00a0I, Elsevier Science and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50009-6"},{"key":"45_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45610-4_9","volume-title":"Rewriting Techniques and Applications","author":"H. Ohsaki","year":"2002","unstructured":"Ohsaki, H., Takai, T.: Decidability and Closure Properties of Equational Tree Languages. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, pp. 114\u2013128. Springer, Heidelberg (2002)"},{"key":"45_CR21","first-page":"611","volume-title":"Proc. of the 17th Int. Joint Conf. on Artificial Intelligence, IJCAI","author":"A. Riazanov","year":"2001","unstructured":"Riazanov, A., Voronkov, A.: Splitting Without Backtracking. In: Proc. of the 17th Int. Joint Conf. on Artificial Intelligence, IJCAI, pp. 611\u2013617. Morgan Kaufmann, San Francisco (2001)"},{"key":"45_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-45610-4_8","volume-title":"Rewriting Techniques and Applications","author":"H. Seki","year":"2002","unstructured":"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.\u00a02378, pp. 98\u2013113. Springer, Heidelberg (2002)"},{"key":"45_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10721975_2","volume-title":"Rewriting Techniques and Applications","author":"S. Tison","year":"2000","unstructured":"Tison, S.: Tree automata and term rewrite systems. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, Springer, Heidelberg (2000)"},{"key":"45_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11539452_19","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"T. Truderung","year":"2005","unstructured":"Truderung, T.: Selecting theories and recursive protocols. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 217\u2013232. Springer, Heidelberg (2005)"},{"key":"45_CR25","unstructured":"Verma, K.N.: Two-Way Equational Tree Automata. PhD thesis, ENS Cachan (September 2003)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11814771_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T06:09:13Z","timestamp":1736575753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11814771_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540371878","9783540371885"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11814771_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}