{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:49:04Z","timestamp":1762458544611},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429579"},{"type":"electronic","value":"9783540456537"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45653-8_48","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:57:30Z","timestamp":1181365050000},"page":"695-706","source":"Crossref","is-referenced-by-count":20,"title":["Reachability Analysis of Term Rewriting Systems with Timbuk"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Genet","sequence":"first","affiliation":[]},{"given":"Val\u00e9rie Viet Triem","family":"Tong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. ELAN: A logical framework based on computational systems. In Proc. 1st WRLA, volume 4 of ENTCS, Asilomar (California), 1996.","DOI":"10.1016\/S1571-0661(04)00032-5"},{"key":"48_CR3","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. http:\/\/www.grappa.univ-lille3.fr\/tata\/ , 1997."},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Formal Language, Grammar and Set-Constraint-Based Program Analysis by Abstract Interpretation. In Conference Record of FPCA\u201995 SIGPLAN\/SIGARCH\/WG2.8, pages 170\u2013181. ACM Press, 1995.","DOI":"10.1145\/224164.224199"},{"key":"48_CR5","first-page":"244","volume":"B","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244\u2013320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI.","journal-title":"Handbook of Theoretical Computer Science"},{"key":"48_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BFb0052368","volume-title":"Proc. 9th RTA Conf., Tsukuba (Japan)","author":"T. Genet","year":"1998","unstructured":"T. Genet. Decidable approximations of sets of descendants and sets of normal forms. In Proc. 9th RTA Conf., Tsukuba (Japan), volume 1379 of LNCS, pages 151\u2013165. Springer-Verlag, 1998."},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"T. Genet and F. Klay. Rewriting for Cryptographic Protocol Verification. In Proc. 7th CADE Conf., Pittsburgh (Pen., USA), volume 1831 of LNAI. Springer-Verlag, 2000.","DOI":"10.1007\/10721959_21"},{"key":"48_CR8","unstructured":"T. Genet and V. Viet Triem Tong. Timbuk Documentation. IRISA \/ Universit\u00e9 de Rennes 1, 2001. http:\/\/www.irisa.fr\/lande\/genet\/timbuk\/ ."},{"key":"48_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","volume":"24","author":"R. Gilleron","year":"1995","unstructured":"R. Gilleron and S. Tison. Regular tree languages and rewrite systems. Fundamenta Informaticae, 24:157\u2013175, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"F. Jacquemard. Decidable approximations of term rewriting systems. In H. Ganzinger, editor, Proc. 7th RTA Conf., New Brunswick New Jersey, USA, pages 362\u2013376. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61464-8_65"},{"key":"48_CR11","unstructured":"N. Jones. Flow analysis of lazy higher-order functional programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 103\u2013122. Ellis Horwood, Chichester, England, 1987."},{"key":"48_CR12","unstructured":"N. Klarlund and A. M\u00f8ller. MONA Version 1.4 User Manual, January 2001."},{"key":"48_CR13","unstructured":"X. Leroy, D. Doligez, J. Garrigue, D. R\u00e9my, and J. Vouillon. The Objective Caml system release 3.00-Documentation and user\u2019s manual. INRIA, 2000. http:\/\/caml.inria.fr\/ocaml\/htmlman\/ ."},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"D. Monniaux. Abstracting Cryptographic Protocols with Tree Automata. In Proc. 6th SAS, Venezia (Italy), 1999.","DOI":"10.1007\/3-540-48294-6_10"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"L. Paulson. Proving Properties of Security Protocols by Induction. In 10th Computer Security Foundations Workshop. IEEE Computer Society Press, 1997.","DOI":"10.1109\/CSFW.1997.596788"},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"P. R\u00e9ty. Regular Sets of Descendants for Constructor-based Rewrite Systems. In Proc. 6th LPAR Conf., Tbilisi (Georgia), volume 1705 of LNAI. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48242-3_10"},{"key":"48_CR17","unstructured":"J. Waldmann. RX: an interpreter for Rational Tree Languages, 1998. http:\/\/www.informatik.uni-leipzig.de\/~joe\/rx\/ ."}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45653-8_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T00:00:54Z","timestamp":1587600054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45653-8_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429579","9783540456537"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45653-8_48","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}