{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:18Z","timestamp":1720624938401},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":1701,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1016\/j.entcs.2008.12.031","type":"journal-article","created":{"date-parts":[[2008,12,25]],"date-time":"2008-12-25T10:41:37Z","timestamp":1230201697000},"page":"61-70","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Handling Left-Quadratic Rules When Completing Tree Automata"],"prefix":"10.1016","volume":"223","author":[{"given":"Y.","family":"Boichut","sequence":"first","affiliation":[]},{"given":"R.","family":"Courbis","sequence":"additional","affiliation":[]},{"given":"P.-C.","family":"H\u00e9am","sequence":"additional","affiliation":[]},{"given":"O.","family":"Kouchnarenko","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2008.12.031_bib001","series-title":"Computer Aided Verification","first-page":"555","article-title":"Regular tree model checking","volume":"volume 2404","author":"Abdulla","year":"2002"},{"key":"10.1016\/j.entcs.2008.12.031_bib002","series-title":"Term Rewriting and All That","author":"Baader","year":"1998"},{"key":"10.1016\/j.entcs.2008.12.031_bib003","doi-asserted-by":"crossref","unstructured":"Y. Boichut, R. Courbis, P.-C. Ham, and O. Kouchnarenko. Finer is better: Abstraction refinement for rewriting approximations. In RTA'08, LNCS, 2008. To appear","DOI":"10.1007\/978-3-540-70590-1_4"},{"key":"10.1016\/j.entcs.2008.12.031_bib004","series-title":"proceedings of RTA","first-page":"48","article-title":"Rewriting approximations for fast prototyping of static analyzers","volume":"4533","author":"Boichut","year":"2007"},{"key":"10.1016\/j.entcs.2008.12.031_bib005","series-title":"Term Rewriting and Applications, 18th International Conference, Proceedings","first-page":"48","article-title":"Rewriting approximations for fast prototyping of static analyzers","volume":"volume 4533","author":"Boichut","year":"2007"},{"key":"10.1016\/j.entcs.2008.12.031_bib006","unstructured":"Y. Boichut, P.-C. H\u00e9am, and O. Kouchnarenko. Automatic Verification of Security Protocols Using Approximations. Technical Report RR-5727, INRIA, 2005"},{"key":"10.1016\/j.entcs.2008.12.031_bib007","series-title":"ICTAC'06","first-page":"153","article-title":"Handling algebraic properties in automatic analysis of security protocols","volume":"volume 4281","author":"Boichut","year":"2006"},{"key":"10.1016\/j.entcs.2008.12.031_bib008","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.entcs.2005.11.015","article-title":"Abstract regular tree model checking","volume":"149","author":"Bouajjani","year":"2006","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2008.12.031_bib009","series-title":"Computer Aided Verification","first-page":"539","article-title":"Extrapolating tree transformations","volume":"volume 2404","author":"Bouajjani","year":"2002"},{"key":"10.1016\/j.entcs.2008.12.031_bib010","series-title":"9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Proceedings","article-title":"Pattern-based abstraction for verifying secrecy in protocols","volume":"volume 2619","author":"Bozga","year":"2003"},{"key":"10.1016\/j.entcs.2008.12.031_bib011","series-title":"Intrusion and Malware Detection and Vulnerability Assessment: Second International Conference","article-title":"Automatic detection of attacks on cryptographic protocols: A case study","volume":"volume 3548","author":"Cibrario","year":"2005"},{"key":"10.1016\/j.entcs.2008.12.031_bib012","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications, 2002"},{"key":"10.1016\/j.entcs.2008.12.031_bib013","series-title":"Rewriting Techniques and Applications, 4th International Conference","first-page":"287","article-title":"Bottom-up tree pushdown automata and rewrite systems","volume":"488","author":"Coquid\u00e9","year":"1991"},{"key":"10.1016\/j.entcs.2008.12.031_bib014","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/JCS-2006-14101","article-title":"A survey of algebraic properties used in cryptographic protocols","volume":"14","author":"Cortier","year":"2006","journal-title":"Journal of Computer Security"},{"key":"10.1016\/j.entcs.2008.12.031_bib015","unstructured":"Dauchet and Tison. The theory of ground rewrite systems is decidable. In LICS: IEEE Symposium on Logic in Computer Science, 1990"},{"key":"10.1016\/j.entcs.2008.12.031_bib016","series-title":"Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems","author":"Dershowitz","year":"1990"},{"key":"10.1016\/j.entcs.2008.12.031_bib017","unstructured":"G. Feuillade, Th. Genet, and V. Viet Triem Tong. Reachability analysis of term rewriting systems. Technical Report RR-4970, INRIA, 2003. To be published in Journal of Automated Reasoning, 2004"},{"issue":"3\u20134","key":"10.1016\/j.entcs.2008.12.031_bib018","article-title":"Reachability analysis over term rewriting systems","volume":"33","author":"Feuillade","year":"2004","journal-title":"Journal of Automated Reasonning"},{"key":"10.1016\/j.entcs.2008.12.031_bib019","series-title":"proceedings of CADE","first-page":"271","article-title":"Rewriting for Cryptographic Protocol Verification","volume":"volume 1831","author":"Genet","year":"2000"},{"issue":"1\/2","key":"10.1016\/j.entcs.2008.12.031_bib020","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","article-title":"Regular tree languages and rewrite systems","volume":"24","author":"Gilleron","year":"1995","journal-title":"Fundamenta Informatica"},{"key":"10.1016\/j.entcs.2008.12.031_bib021","series-title":"SAS'06, 13th International Static Analysis Symposium","first-page":"52","article-title":"Abstract regular tree model checking of complex dynamic data structures","volume":"volume 4134","author":"Habermehl","year":"2006"},{"key":"10.1016\/j.entcs.2008.12.031_bib022","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/j.entcs.2008.12.031_bib023","series-title":"proceedings of RTA","first-page":"362","article-title":"Decidable approximations of term rewriting systems","author":"Jacquemard","year":"1996"},{"issue":"1","key":"10.1016\/j.entcs.2008.12.031_bib024","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.entcs.2004.07.017","article-title":"ACTAS: A system design for associative and commutative tree automata theory","volume":"124","author":"Ohsaki","year":"2005","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"6","key":"10.1016\/j.entcs.2008.12.031_bib025","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0661(04)80606-6","article-title":"Regular sets of descendants by leftmost strategy","volume":"70","author":"R\u00e9ty","year":"2002","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.entcs.2008.12.031_bib026","article-title":"Deterministic tree pushdown automata and monadic tree rewriting systems","volume":"37","author":"Salomaa","year":"1988","journal-title":"JCSS: Journal of Computer and System Sciences"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066108004945?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066108004945?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T03:53:58Z","timestamp":1589428438000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066108004945"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":26,"alternative-id":["S1571066108004945"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2008.12.031","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}