{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:10:01Z","timestamp":1737504601575,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_56","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"682-693","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols"],"prefix":"10.1007","author":[{"given":"Hubert","family":"Comon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e9ronique","family":"Cortier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"56_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and A. Gordon. A calculus for cryptographic protocols: the spi calculus. Information and Computation, 148(1), 1999.","DOI":"10.1006\/inco.1998.2740"},{"key":"56_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0167-6423(99)00007-6","volume":"35","author":"A. Aiken","year":"1999","unstructured":"A. Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming, 35:79\u2013111, 1999.","journal-title":"Science of Computer Programming"},{"key":"56_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CONCUR\u201900","author":"R. Amadio","year":"2000","unstructured":"R. Amadio and D. Lugiez. On the reachability problem in cryptographic protocols. In Proc. CONCUR\u201900, volume 1877 of Lecture Notes in Computer Science, 2000."},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"B. Bogaert and S. Tison. Equality and disequality constraints on brother terms in tree automata. In A. Finkel, editor, Proc. 9th. Symposium on Theoretical Aspects of Comp. Science, Cachan, France, 1992.","DOI":"10.1007\/3-540-55210-3_181"},{"key":"56_CR5","unstructured":"I. Cervesato, N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. A meta-notation for protocol analysis. In P. Syverson, editor, 12-th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, 1999."},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"W. Charatonik and L. Pacholski. Negative set constraints with equality. In Proc. IEEE Symp. on Logic in Computer Science, pages 128\u2013136, Paris, 1994.","DOI":"10.1109\/LICS.1994.316078"},{"key":"56_CR7","unstructured":"W. Charatonik and A. Podelski. Set constraints with intersection. In Proc. IEEE Symposium on Logic in Computer Science, Varsaw, 1997."},{"key":"56_CR8","unstructured":"J. Clarke and J. Jacobs. A survey of authentication protocol. literature: Version 1.0. Draft paper, 1997."},{"key":"56_CR9","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata , 1997."},{"key":"56_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0019-9958(82)90401-6","volume":"55","author":"D. Dolev","year":"1982","unstructured":"D. Dolev, S. Even, and R. Karp. On the security of ping pong protocols. Information and Control, 55:57\u201368, 1982.","journal-title":"Information and Control"},{"key":"56_CR11","doi-asserted-by":"crossref","unstructured":"D. Dolev and A. Yao. On the security of public key protocols. In Proc. IEEE Symp. on Foundations of Computer Science, pages 350\u2013357, 1981.","DOI":"10.1109\/SFCS.1981.32"},{"key":"56_CR12","unstructured":"N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Proc. Workshop on formal methods in security protocols, Trento, Italy, 1999."},{"key":"56_CR13","doi-asserted-by":"crossref","unstructured":"S. Even and O. Goldreich. On the security of multi-party ping-pong protocols. Technical Report 285, Technion, Haifa, Israel, 1983. Extended abstract appeared in IEEE Symp. Foundations of Computer Science, 1983.","DOI":"10.1109\/SFCS.1983.42"},{"key":"56_CR14","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Tygar. A model for secure protocols and their compositions. IEEE transactions on software engineering, 22(1), 1996.","DOI":"10.1109\/32.481514"},{"key":"56_CR15","unstructured":"N. Heinze and J. Jaffar. A decision procedure for a class of set constraints. In Proc. IEEE Symp. on Logic in Computer Science, Philadelphia, 1990."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:49:59Z","timestamp":1737503399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_56","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"4 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}