{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T18:00:52Z","timestamp":1725645652350},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540189947"},{"type":"electronic","value":"9783642734519"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/978-3-642-73451-9_10","type":"book-chapter","created":{"date-parts":[[2011,12,26]],"date-time":"2011-12-26T13:37:21Z","timestamp":1324906641000},"page":"119-131","source":"Crossref","is-referenced-by-count":2,"title":["Code Generation and RISC Architectures"],"prefix":"10.1007","author":[{"given":"Susan L.","family":"Graham","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"A. V. Aho and S. C. Johnson, \u201cOptimal Code Generation for Expression Trees\u201d, J. ACM 3 (July 1976), 488\u2013501.","DOI":"10.1145\/321958.321970"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"A. V. Aho and M. Ganapathi, \u201cEfficient tree pattern matching: an aid to code generation\u201d, Conf. Rec. 12th ACM Symp. on Prin. of Prog. Lang., Jan. 1985, 334\u2013340.","DOI":"10.1145\/318593.318663"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"P. Aigrain, S. L. Graham, R. R. Henry, M. K. McKusick and E. Pelegri-Llopart, \u201cExperience with a Graham-Glanville Style Code Generator\u201d, Proc. SIGPLAN 1984 Symp. on Compiler Const., June 1984.","DOI":"10.1145\/502874.502876"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/spe.4380070311","volume":"7","author":"U Ammann","year":"1977","unstructured":"U. Ammann, \u201cOn Code Generation in a PASCAL Compiler\u201d, Software\u2014Practice & Experience 7 (1977), 391\u2013423.","journal-title":"Software\u2014Practice & Experience"},{"key":"10_CR5","volume-title":"History of Programming Languages","author":"J Backus","year":"1981","unstructured":"J. Backus, \u201cThe History of Fortran I, II, and III\u201d, in History of Programming Languages, R. Wexelblat (editor), Academic Press, New York, 1981."},{"key":"10_CR6","unstructured":"C. G. Bell, \u201cRISC.: Back to the Future?\u201d, Datamation 32,11 (1 June 1986)."},{"key":"10_CR7","unstructured":"A. D. Berenbaum, D. R. Ditzel and H. R. McLellan, \u201cIntroduction to the CRISP Instruction Set Architecture\u201d, COMPCON, Feb. 24\u201326 1987."},{"key":"10_CR8","series-title":"CRL-Tech. Rep.","volume-title":"Register Allocation and Instruction Scheduling for Pipelined SISD Processors","author":"PL Bird","year":"1986","unstructured":"P. L. Bird, \u201cRegister Allocation and Instruction Scheduling for Pipelined SISD Processors\u201d, CRL-Tech. Rep.-12-86, University of Michigan, Ann Arbor, June 1986."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","volume":"6","author":"GJ Chaitin","year":"1981","unstructured":"G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins and P. W. Markstein, \u201cRegister Allocation via Coloring\u201d, J. Computer Lang. 6 (1981), 47\u201357.","journal-title":"J. Computer Lang."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"F. Chow and J. L. Hennessy, \u201cRegister Allocation by Priority-Based Coloring\u201d, Proc. SIGPLAN 1984 Symp. on Compiler Const., June 1984.","DOI":"10.1145\/502874.502896"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"K. D. Cooper, \u201cAnalyzing Aliasing of Reference Formal Parameters\u201d, Conf. Rec. 12th ACM Symp. on Prin. of Prog. Lang., Jan. 1985.","DOI":"10.1145\/318593.318658"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"D. S. Coutant, C. L. Hammond and J. W. Kelly, \u201cCompilers for the New Generation of Hewlett-Packard Computers\u201d, Proceedings of COMPCON, March 1986, 48\u201361.","DOI":"10.1021\/cen-v064n049.p048"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"R. N. Faiman and A. A. Kortesoja, \u201cAn Optimizing Pascal Compiler\u201d, IEEE Transactions on Software Engineering SE-6 (1980).","DOI":"10.1109\/TSE.1980.230800"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"C. W. Fraser, \u201cA Knowledge-Based Code Generator Generator.\u201d, Proceedings of the ACM Symposium on Artificial Intelligence and Programming Languages, August 1977.","DOI":"10.1145\/800228.806941"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"C. W. Fraser and A. L. Wendt, \u201cIntegrating Code Generation and Optimization\u201d, Proc. SIGPLAN Notices 1986 Symp. on Compiler Const., June 1986, 242\u2013248.","DOI":"10.1145\/12276.13335"},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1145\/356893.356897","volume":"14","author":"M Ganapathi","year":"1982","unstructured":"M. Ganapathi, C. N. Fischer and J. L. Hennessy, \u201cRetargetable Compiler Code Generation\u201d, Computing Surveys 14,4 (Dec. 1982), 573\u2013592.","journal-title":"Computing Surveys"},{"issue":"4","key":"10_CR17","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/4472.4486","volume":"7","author":"M Ganapathi","year":"1985","unstructured":"M. Ganapathi and C. N. Fischer, \u201cAffix Grammar Driven Code Generation\u201d, Trans. Prog. Lang and Systems 7,4 (Oct. 1985), 560\u2013599.","journal-title":"Trans. Prog. Lang and Systems"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"P. B. Gibbons and S. S. Muchnick, \u201cEfficient Instruction Scheduling for a Pipelined Architecture\u201d, CCC86, June 1986, 11\u201316.","DOI":"10.1145\/13310.13312"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"S. L. Graham, \u201cTable-Driven Code Generation\u201d, IEEE Computer, Aug. 1980, 25.","DOI":"10.1109\/MC.1980.1653744"},{"key":"10_CR20","unstructured":"D. C. Halbert and P. B. Kessler, \u201cWindows of Overlapping Register Frames\u201d, unpublished, June 1980."},{"issue":"3","key":"10_CR21","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/2166.357217","volume":"5","author":"JL Hennessy","year":"1983","unstructured":"J. L. Hennessy and T. R. Gross, \u201cPostpass Code Optimization of Pipeline Constraints\u201d, Trans. Prog. Lang and Systems 5,3 (July 1983), 422\u2013448.","journal-title":"Trans. Prog. Lang and Systems"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"J. L. Hennessy, \u201cVLSI Processor Architecture\u201d, IEEE Transactions on Computers CSS (December 1984), 1221\u20131246, IEEE.","DOI":"10.1109\/TC.1984.1676395"},{"key":"10_CR23","volume-title":"Graham Glanville Code Generators","author":"RR Henry","year":"1984","unstructured":"R. R. Henry, \u201cGraham Glanville Code Generators\u201d, UCB\/Computer Science Dpt. 84\/184, Ph.D Dissertation, University of California, Berkeley, 1984."},{"key":"10_CR24","series-title":"Technical Report","volume-title":"Code Generation Using Tree Pattern Matchers","author":"RR Henry","year":"1987","unstructured":"R. R. Henry and P. C. Damron, \u201cCode Generation Using Tree Pattern Matchers\u201d, Technical Report 87-02-04, University of Washington, Seattle, February 1987."},{"key":"10_CR25","unstructured":"P. D. Hester, R. O. Simpson and A. Chang, \u201cThe IBM RT PC ROMP and Memory Management Unit Architecture\u201d, IBM Publication No. SA23-1057,, IBM Personal Computer Technology, 1986."},{"key":"10_CR26","unstructured":"U. Kastens, \u201cCode Generation Based on Operator Identification\u201d, manuscript, Universitat-GH Paderborn, 1987."},{"key":"10_CR27","unstructured":"M. G. H. Katevenis, \u201cReduced Instruction Set Computer Architectures for VLSI\u201d, Tech. Rep. UCB\/Computer Science Dpt. 83\/141, PhD Diss., UCB, 1983."},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"R. Landwehr, H. Jansohn and G. Goos, \u201cExperience with an Automatic Code Generator Generator\u201d, Proc. SIGPLAN 1982 Symp. on Compiler Const., June 1982, 56\u201366.","DOI":"10.1145\/800230.806980"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"J. R. Larus and P. N. Hilfinger, \u201cRegister Allocation in the SPUR Lisp Compiler\u201c, Proc. SIGPLAN Notices 1986 Symp. on Compiler Const., June 1986, 255\u2013263.","DOI":"10.1145\/12276.13337"},{"key":"10_CR30","volume-title":"Register Allocation and Data Conversion in Machine Independent Code Generators","author":"MK McKusick","year":"1984","unstructured":"M. K. McKusick, \u201cRegister Allocation and Data Conversion in Machine Independent Code Generators\u201d, 84\/214, PhD Diss., Computer Science Division, EECS, UCB, Berkeley, CA, Dec. 1984."},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"D. A. Patterson and C. H. Sequin, \u201cA VLSI RISC\u201d, IEEE Computer, Sep. 1982.","DOI":"10.1109\/MC.1982.1654133"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"E. Pelegri-Llopart and S. L. Graham, \u201cOptimal Code Generation for Expression Trees: An Application of BURS Theory\u201d, ACM Symposium on Principles of Programming Languages, San Diego, January 1988.","DOI":"10.1145\/73560.73586"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"G. Radin, \u201cThe 801 Minicomputer\u201d, Proc. of the Symp. on Arch. Support for Prog. Lang, and Operating Systems, Mar. 1982, 39\u201347.","DOI":"10.1145\/800050.801824"},{"key":"10_CR34","volume-title":"Lecture, CS265","author":"L Semenzato","year":"1987","unstructured":"L. Semenzato, Lecture, CS265, University of California, Berkeley, October 1987."},{"issue":"4","key":"10_CR35","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1145\/321607.321620","volume":"17","author":"R Sethi","year":"1970","unstructured":"R. Sethi and J. D. Ullman, \u201cThe Generation of Optimal Code for Arithmetic Expressions\u201d, J. ACM 17,4 (Oct. 1970), 715\u2013728.","journal-title":"J. ACM"},{"key":"10_CR36","unstructured":"W. Stallings, ed., Reduced Instruction Set Computers, IEEE, 1986."},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"P. Steenkiste and J. Hennessy, \u201cLISP on a Reduced-Instruction-Set Processor\u201d, Proceedings of the 1986 Conference on LISP and Functional Programming, Boston, August 1986, 192\u2013201.","DOI":"10.1145\/319838.319862"},{"issue":"3","key":"10_CR38","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/359361.359454","volume":"21","author":"AS Tanenbaum","year":"1978","unstructured":"A. S. Tanenbaum, \u201cImplications of Structured Programming for Machine Architecture\u201d, Comm. of the ACM 21,3 (Mar. 1978), 237\u2013244.","journal-title":"Comm. of the ACM"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"G. S. Taylor, P. N. Hilfinger, J. R. Larus, D. A. Patterson and B. G. Zorn, \u201cEvaluation of the SPUR Lisp Architecture\u201d, Thirteenth International Symposium on Computer Architecture, June 1986.","DOI":"10.1145\/17356.17379"},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"D. Wall, \u201cGlobal Register Allocation at Link Time\u201d, Proc. SIGPLAN Notices 1986 Symp. on Compiler Const., June 1986, 264\u2013275.","DOI":"10.1145\/12276.13338"},{"key":"10_CR41","volume-title":"Two Tree Pattern Matchers for Code Selection (Including Targeting)","author":"B Weisgerber","year":"1986","unstructured":"B. Weisgerber and R. Wilhelm, \u201cTwo Tree Pattern Matchers for Code Selection (Including Targeting)\u201d, A 09\/86, Universitat des Saarlandes, Saarbr\u00fccken, 1986."},{"key":"10_CR42","volume-title":"The Design of an Optimizing Compiler","author":"WA Wulf","year":"1975","unstructured":"W. A. Wulf, R. K. Johnsson, C. B. Weinstock, S. O. Hobbs and C. M. Geschke, The Design of an Optimizing Compiler, North-Holland, New York, NY, 1975."},{"issue":"7","key":"10_CR43","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/C-M.1981.220527","volume":"14","author":"WA Wulf","year":"1981","unstructured":"W. A. Wulf, \u201cCompilers and Computer Architecture\u201d, IEEE Computer 14,7 (July 1981), 41\u201348.","journal-title":"IEEE Computer"}],"container-title":["Informatik-Fachberichte","Architektur und Betrieb von Rechensystemen"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-73451-9_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T12:36:27Z","timestamp":1620304587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-73451-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540189947","9783642734519"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-73451-9_10","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1988]]}}}