{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:06:32Z","timestamp":1759190792546,"version":"3.44.0"},"publisher-location":"London","reference-count":21,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540197577"},{"type":"electronic","value":"9781447135012"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-1-4471-3501-2_1","type":"book-chapter","created":{"date-parts":[[2013,2,1]],"date-time":"2013-02-01T11:32:03Z","timestamp":1359718323000},"page":"3-29","source":"Crossref","is-referenced-by-count":8,"title":["Code Selection by Regularly Controlled Term Rewriting"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Emmelmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","volume-title":"Code Generation Using Tree Matching and Dynamic Programming, Technical Report","author":"AV Aho","year":"1986","unstructured":"A.V. Aho, M. Ganapathi, S.W. Tjiang, Code Generation Using Tree Matching and Dynamic Programming, Technical Report, Bell Laboratories, Murray Hill, NJ, January 1986"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0096-0551(90)90006-B","volume":"15","author":"A Balachandran","year":"1990","unstructured":"A Balachandran, D. M. Dhamdhere, S. Biswas, Efficient Retargetable Code Generation Using Bottom-up Tree Pattern Matching, Computer Languages, 15 (3): 127\u2013140, 1990","journal-title":"Computer Languages"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"H. Emmelmann, F-W. Schr\u00f6er, R. Landwehr, BEG - a Generator for Efficient Back Ends, Proc. of the Sigplan\u201989 Conference on Programming Language Design and Implementation, Sigplan Notices, Vol. 24, Number 7, July 1989","DOI":"10.1145\/74818.74838"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"M.Ganapathi, C. N. Fischer, J.L. Hennessy, Retargetable Compiler Code Generation, Computing Surveys Vol.14 No.4, Dec 82","DOI":"10.1145\/356893.356897"},{"key":"1_CR5","first-page":"231","volume-title":"A New Method for Compiler Code Generation","author":"RS Glanville","year":"1977","unstructured":"R.S.Glanville, S.L.Graham, A New Method for Compiler Code Generation, Proceedings 5th ACM Symposium on Principles of Programming Languages, pp. 231\u2013240, 1977"},{"key":"1_CR6","first-page":"119","volume-title":"High-Quality Code Generation Via Bottom Up Tree Pattern Matching","author":"PJ Hatcher","year":"1986","unstructured":"P.J. Hatcher, T.W. Christopher, High-Quality Code Generation Via Bottom Up Tree Pattern Matching, Proceedings 13th ACM Symposium on Principles of Programming Languages pp. 119\u2013130, 1986"},{"key":"1_CR7","unstructured":"R. Henry, P.Damron, Performance of Table\u2013Driven Code Generators Using Tree\u2013Pattern Matching, Technical Report # 89\u201302\u201302 Computer Science Department, FR\u201335 University of Washington, Seattle, WA 98195 USA"},{"key":"1_CR8","unstructured":"R. Henry, P. Damron, Algorithms for Table\u2013Driven Code Generators Using Tree\u2013Pattern Matching, Technical Report # 89\u201302\u201303 Computer Science Department, FR\u201335 University of Washington, Seattle, WA 98195 USA"},{"key":"1_CR9","unstructured":"R. Henry, Encoding Optimal Pattern Selection in a Table\u2013Driven Bottom\u2013Up Tree\u2013Pattern Matcher, Technical Report # 89\u201302\u201304 Computer Science Department, FR\u201335 University of Washington, Seattle, WA 98195 USA"},{"key":"1_CR10","volume-title":"Two Tree Pattern Matchers for Code Selection (Including Targeting), Technical Report","author":"B Weisgerber","year":"1986","unstructured":"B.Weisgerber, R.Wilhelm, Two Tree Pattern Matchers for Code Selection (Including Targeting), Technical Report, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, W. Germany, February 1986"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1145\/357094.357097","volume":"2","author":"RG Cattell","year":"1980","unstructured":"R.G.G. Cattell, Automatic Derivation of Code Generators from Machine Descriptions, ACM Transactions on Programming Languages and Systems, April 1980, Volume 2, Number 2, p. 173\u2013190","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR12","first-page":"294","volume-title":"Optimal Code Generation for Expression Trees: An Application of BURS Theory","author":"E Pelegri-Llopart","year":"1988","unstructured":"E. Pelegri-Llopart, S. Graham, Optimal Code Generation for Expression Trees: An Application of BURS Theory, Proc. of the 15th ACM Symposium on Principles of Programming Languages, 1988, p. 294\u2013308"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"C.W. Fraser, R.R. Henry, Hard-coding Bottom-up Code Generation Tables to Save Time and Space, Software Practice & Experience, January 1991, Volume 21, No. 1","DOI":"10.1002\/spe.4380210102"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0304-3975(90)90145-8","volume":"73","author":"R Giegerich","year":"1990","unstructured":"R.Giegerich, Code Selection by Inversion of Order-Sorted Derivors, Theoretical Computer Science 73 (1990), p. 177\u2013211","journal-title":"Theoretical Computer Science"},{"key":"1_CR15","unstructured":"R. Giegerich, On the Structure of Verifiable Code Generator Specifications, Proc. of the ACM SIGPLAN\u201990 Conference on Programming Language Design and Implementation, p.1\u20138, Sigplan Notices, Vol. 25, Number 6, June 1990"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C Hoffmann","year":"1982","unstructured":"C. Hoffmann, J.O\u2019Donnell, Pattern Matching in Trees, Journal of the ACM Vol. 29, No. 1, January 1982, pp. 68\u201395","journal-title":"Journal of the ACM"},{"key":"1_CR17","volume-title":"Rewrite Systems, Pattern Matching and Cod\u00e9 Generation, Dissertation","author":"E Pelegri-Llopart","year":"1987","unstructured":"E. Pelegri-Llopart, Rewrite Systems, Pattern Matching and Cod\u00e9 Generation, Dissertation, EECS-Report, UC Berkeley, 1987"},{"key":"1_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8853-1","volume-title":"Finite Automata, Their Algebras and Grammars, Towards a Theory of Formal Expressions","author":"JR B\u00fcchi","year":"1989","unstructured":"J.R. B\u00fcchi, Finite Automata, Their Algebras and Grammars, Towards a Theory of Formal Expressions, Springer-Verlag, New York, 1989"},{"key":"1_CR19","first-page":"143","volume-title":"Tree Automata: An Informal Survey, Currents in the Theory of Computing","author":"JW Thatcher","year":"1973","unstructured":"J.W.Thatcher, Tree Automata: An Informal Survey, Currents in the Theory of Computing, A.V. Aho (editor), Prentice Hall, Englewood CLiffs, NJ, 1973, 143\u2013172"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/S0019-9958(68)90917-0","volume":"13","author":"WS Thatcher","year":"1968","unstructured":"W.S.Brainerd, Minimalization of Tree Automata, Information and Control 13 (1968) p. 484\u2013491","journal-title":"Information and Control"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"D.R.Chase, An Improvement to Bottom-up Tree Pattern Matching, POPL87, Munich, Germany, January 1987","DOI":"10.1145\/41625.41640"}],"container-title":["Workshops in Computing","Code Generation \u2014 Concepts, Tools, Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3501-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:07:24Z","timestamp":1759136844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-3501-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540197577","9781447135012"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3501-2_1","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1992]]}}}