{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T05:14:24Z","timestamp":1733548464568,"version":"3.30.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4825,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0304-3975(00)00041-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:38:29Z","timestamp":1027651109000},"page":"439-464","source":"Crossref","is-referenced-by-count":1,"title":["Pattern-matching algorithms based on term rewrite systems"],"prefix":"10.1016","volume":"238","author":[{"given":"Joost-Pieter","family":"Katoen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Nymeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0304-3975(00)00041-4_BIB1","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/69558.75700","article-title":"Code generation using tree matching and dynamic programming","volume":"11","author":"Aho","year":"1989","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"3","key":"10.1016\/S0304-3975(00)00041-4_BIB2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0096-0551(90)90006-B","article-title":"Efficient retargetable code generation using bottom-up tree pattern matching","volume":"15","author":"Balachandran","year":"1990","journal-title":"Comput. Languages"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB3","doi-asserted-by":"crossref","unstructured":"D.R. Chase, An improvement to bottom-up tree pattern matching, Proc. 14th Annual ACM Symp. on Principles of Programming Languages, Munich, Germany, January 1987, pp. 168\u2013177.","DOI":"10.1145\/41625.41640"},{"issue":"6","key":"10.1016\/S0304-3975(00)00041-4_BIB4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/502874.502877","article-title":"Using dynamic programming to generate optimised code in a Graham-Glanville style code generator","volume":"19","author":"Christopher","year":"1984","journal-title":"Proc. ACM SIGPLAN 1984 Symp. on Compiler Construction; ACM SIGPLAN Notices"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB5","series-title":"Rewriting Techniques and Applications","first-page":"180","article-title":"Termination","volume":"Vol. 202","author":"Dershowitz","year":"1985"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Termination of rewriting","volume":"3","author":"Dershowitz","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(00)00041-4_BIB7","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: J. Van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 245\u2013320 (Chapter 6).","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB8","series-title":"Code generation \u2013 Concepts, Tools, Techniques","first-page":"3","article-title":"Code selection by regularly controlled term rewriting","author":"Emmelmann","year":"1991"},{"issue":"7","key":"10.1016\/S0304-3975(00)00041-4_BIB9","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/74818.74838","article-title":"BEG \u2013 a generator for efficient back ends","volume":"24","author":"Emmelmann","year":"1989","journal-title":"ACM SIGPLAN Notices"},{"issue":"3","key":"10.1016\/S0304-3975(00)00041-4_BIB10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/151640.151642","article-title":"Engineering a simple, efficient code-generator generator","volume":"1","author":"Fraser","year":"1992","journal-title":"ACM Letters on Programming Languages and Systems"},{"issue":"4","key":"10.1016\/S0304-3975(00)00041-4_BIB11","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/4472.4486","article-title":"Affix grammar driven code generation","volume":"7","author":"Ganapathi","year":"1985","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(90)90145-8","article-title":"Code selection by inversion of order-sorted derivors","volume":"73","author":"Giegerich","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00041-4_BIB13","series-title":"Proc. 2nd European Symp. on Programming","first-page":"247","article-title":"Code selection techniques: pattern matching, tree parsing, and inversion of derivors","volume":"Vol. 300","author":"Giegerich","year":"1988"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB14","doi-asserted-by":"crossref","unstructured":"R.S. Glanville, S.L. Graham, A new method for compiler code generation, Conf. Record 5th Annual ACM Symp. on Principles of Programming Languages, Tucson, AZ, January 1978, pp. 231\u2013240.","DOI":"10.1145\/512760.512785"},{"issue":"1","key":"10.1016\/S0304-3975(00)00041-4_BIB15","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/249094.249110","article-title":"Bottom-up tree rewriting tool MBURG","volume":"31","author":"Gough","year":"1996","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB16","doi-asserted-by":"crossref","unstructured":"P.J. Hatcher, T.W. Christopher, High-quality code generation via bottom-up tree pattern matching, Proc. 13th Annual ACM Symp. on Principles of Programming Languages, Tampa Bay, FL, January 1986, pp. 119\u2013130.","DOI":"10.1145\/512644.512655"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0167-6423(89)90015-4","article-title":"Bottom-up tree acceptors","volume":"13","author":"Hemerik","year":"1990","journal-title":"Sci. Comput. Programming"},{"year":"1992","series-title":"Narrowing and basic forward closures, Technical Report 5, Technische Fakult\u00e4t","author":"Kurtz","key":"10.1016\/S0304-3975(00)00041-4_BIB18"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0304-3975(96)00172-7","article-title":"Simple termination of rewrite systems","volume":"175","author":"Middeldorp","year":"1997","journal-title":"Theoret. Comput. Sci."},{"issue":"8","key":"10.1016\/S0304-3975(00)00041-4_BIB20","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s002360050099","article-title":"Code generation based on formal BURS theory and heuristic search","volume":"34","author":"Nymeyer","year":"1997","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00041-4_BIB21","series-title":"Compiler Construction","first-page":"160","article-title":"Code generation = A* + BURS","volume":"Vol. 1060","author":"Nymeyer","year":"1996"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB22","series-title":"Computing in Systems Described by Equations, Lecture Notes in Computer Science, Vol. 58","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-08531-9","author":"O'Donnel","year":"1977"},{"year":"1987","series-title":"Rewrite systems, pattern matching, and code generation, Ph.D. Thesis","author":"Pelegr\u0131\u0301-Llopart","key":"10.1016\/S0304-3975(00)00041-4_BIB23"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB24","doi-asserted-by":"crossref","unstructured":"E. Pelegr\u0131\u0301-Llopart, S.L. Graham, Optimal code generation for expression trees: An application of BURS theory, Proc. 15th Annual ACM Symp. on Principles of Programming Lanuguages, San Diego, CA, January 1998, pp. 294\u2013308.","DOI":"10.1145\/73560.73586"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB25","series-title":"Compiler Construction","first-page":"294","article-title":"One-pass, optimal tree parsing \u2013 with or without trees","author":"Proebsting","year":"1996"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB26","series-title":"Proc. 3rd Internat. Conf. on Rewriting Techniques and Applications","first-page":"434","article-title":"Extensions and comparison of simplification orderings","volume":"Vol. 355","author":"Steinbach","year":"1989"},{"key":"10.1016\/S0304-3975(00)00041-4_BIB27","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","article-title":"Termination of term rewriting by semantic labelling","volume":"24","author":"Zantema","year":"1994","journal-title":"Fund. Inform."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000414?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000414?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T16:12:12Z","timestamp":1733501532000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397500000414"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00041-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}