{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:14:12Z","timestamp":1740028452017,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_43","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:40:30Z","timestamp":1268401230000},"page":"518-530","source":"Crossref","is-referenced-by-count":2,"title":["Alternation in Equational Tree Automata Modulo XOR"],"prefix":"10.1007","author":[{"given":"Kumar Neeraj","family":"Verma","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-24597-1_11","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"Y. Chevalier","year":"2003","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M.: Deciding the security of protocols with diffie-hellman exponentiation and products in exponents. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 124\u2013135. Springer, Heidelberg (2003)"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M.: An NP decision procedure for protocol insecurity with XOR. In: LICS 2003, pp. 261\u2013270 (2003)","DOI":"10.1109\/LICS.2003.1210066"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science (2004) (to appear)","DOI":"10.1016\/j.tcs.2004.09.036"},{"key":"43_CR4","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"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-44881-0_12","volume-title":"Rewriting Techniques and Applications","author":"H. Comon-Lundh","year":"2003","unstructured":"Comon-Lundh, H., Cortier, V.: New decidability results for fragments of first-order logic and application to cryptographic protocols. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 148\u2013164. Springer, Heidelberg (2003)"},{"key":"43_CR6","unstructured":"Cortier, V.: V\u00e9rification Automatique des Protocoles Cryptographiques. Ph.D. thesis, ENS Cachan, France (2003)"},{"key":"43_CR7","first-page":"1","volume-title":"Handbook of Formal Languages, ch. 1","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 1, vol.\u00a03, pp. 1\u201368. Springer, Heidelberg (1997)"},{"key":"43_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1007\/3-540-45591-4_134","volume-title":"Parallel and Distributed Processing","author":"J. Goubault-Larrecq","year":"2000","unstructured":"Goubault-Larrecq, J.: A method for automatic cryptographic protocol verification. In: Rolim, J.D.P. (ed.) IPDPS-WS 2000. LNCS, vol.\u00a01800, pp. 977\u2013984. Springer, Heidelberg (2000)"},{"key":"43_CR9","unstructured":"Goubault-Larrecq, J.: Une fois qu\u2019on n\u2019a pas trouv\u00e9 de preuve, comment le faire comprendre \u00e0 un assistant de preuve? In: M\u00e9nissier-Morain, V. (ed.) Actes des 12\u00e8mes Journ\u00e9es Francophones des Langages Applicatifs (JFLA 2004), INRIA, collection didactique (2004)"},{"key":"#cr-split#-43_CR10.1","doi-asserted-by":"crossref","unstructured":"Goubault-Larrecq, J., Roger, M., Verma, K.N.: Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. Journal of Logic and Algebraic Programming (2004) (to Appear);","DOI":"10.1016\/j.jlap.2004.09.004"},{"key":"#cr-split#-43_CR10.2","unstructured":"Available as Research Report LSV-04-7, LSV, ENS Cachan"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Pansiot, J.J.: On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science\u00a08, 135\u2013159 (1979)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"43_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Computer and System Sciences\u00a03(2), 147\u2013195 (1969)","journal-title":"J. Computer and System Sciences"},{"key":"43_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-36576-1_21","volume-title":"Foundations of Software Science and Computational Structures","author":"D. Lugiez","year":"2003","unstructured":"Lugiez, D.: Counting and equality constraints for multitree automata. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 328\u2013342. Springer, Heidelberg (2003)"},{"key":"43_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-48294-6_10","volume-title":"Static Analysis","author":"D. Monniaux","year":"1999","unstructured":"Monniaux, D.: Abstracting cryptographic protocols with tree automata. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, pp. 149\u2013163. Springer, Heidelberg (1999)"},{"key":"43_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-44802-0_38","volume-title":"Computer Science Logic","author":"H. Ohsaki","year":"2001","unstructured":"Ohsaki, H.: Beyond regularity: Equational tree automata for associative and commutative theories. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 539\u2013553. Springer, Heidelberg (2001)"},{"key":"43_CR16","first-page":"84","volume-title":"CSFW 1997","author":"L.C. Paulson","year":"1997","unstructured":"Paulson, L.C.: Mechanized proofs for a recursive authentication protocol. In: CSFW 1997, pp. 84\u201395. IEEE Computer Society Press, Los Alamitos (1997)"},{"issue":"1","key":"43_CR17","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(97)00180-4","volume":"65","author":"P. Ryan","year":"1998","unstructured":"Ryan, P., Schneider, S.: An attack on a recursive authentication protocol: A cautionary tale. Information Processing Letters\u00a065(1), 7\u201310 (1998)","journal-title":"Information Processing Letters"},{"key":"43_CR18","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(85)90077-5","volume":"41","author":"G. Slutzki","year":"1985","unstructured":"Slutzki, G.: Alternating tree automata. Theoretical Computer science\u00a041, 305\u2013318 (1985)","journal-title":"Theoretical Computer science"},{"issue":"8","key":"43_CR19","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/71.877936","volume":"11","author":"M. Steiner","year":"2000","unstructured":"Steiner, M., Tsudik, G., Waidner, M.: Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems\u00a011(8), 769\u2013780 (2000)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"43_CR20","unstructured":"Verma, K.N.: Automates d\u2019arbres bidirectionnels modulo th\u00e9ories \u00e9quationnelles. Ph.D. thesis, ENS Cachan (2003)"},{"key":"43_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-39813-4_12","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K.N. Verma","year":"2003","unstructured":"Verma, K.N.: On closure under complementation of equational tree automata for theories extending AC. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 183\u2013197. Springer, Heidelberg (2003)"},{"key":"43_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-44881-0_14","volume-title":"Rewriting Techniques and Applications","author":"K.N. Verma","year":"2003","unstructured":"Verma, K.N.: Two-way equational tree automata for AC-like theories: Decidability and closure properties. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 180\u2013196. Springer, Heidelberg (2003)"},{"key":"43_CR23","doi-asserted-by":"crossref","unstructured":"Verma, K.N., Goubault-Larrecq, J.: Karp-Miller trees for a branching extension of VASS. Research Report LSV-04-3, LSV, ENS Cachan, France (January 2004)","DOI":"10.46298\/dmtcs.350"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T12:12:16Z","timestamp":1739967136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}