{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:57Z","timestamp":1725456237073},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630913"},{"type":"electronic","value":"9783540691280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0017249","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:31:40Z","timestamp":1132641100000},"page":"120-134","source":"Crossref","is-referenced-by-count":2,"title":["Initial results for glacial variable analysis"],"prefix":"10.1007","author":[{"given":"Tito","family":"Autrey","sequence":"first","affiliation":[]},{"given":"Michael","family":"Wolfe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"J. Auslander, M. Philipose, C. Chambers, S. J. Eggers, and B. N. Bershad. Fast, effective dynamic compilation. In PLDI96 [14], pages 149\u2013159.","DOI":"10.1145\/231379.231409"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"R. A. Ballance, A. B. Maccabe, and K. J. Ottenstein. The Program Dependence Web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages. In Proc. ACM SIGPLAN '90 Conf. on Programming Language Design and Implementation, pages 257\u2013271, White Plains, NY, June 1990.","DOI":"10.1145\/93548.93578"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"C. Consel and O. Danvy. Tutorial notes on partial evaluation. In Conf. Record 20th Annual ACM Symp. Principles of Programming Languages, pages 493\u2013501, Charleston, SC, Jan. 1993.","DOI":"10.1145\/158511.158707"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"C. Consel and F. No\u00ebl. A general approach to run-time specialization and its application to C. In Conf. Record 23rd Annual ACM Symp. Principles of Programming Languages, pages 145\u2013156, St Petersburg, FL, Jan. 1996.","DOI":"10.1145\/237721.237767"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"D. R. Engler. Vcode: A retargetable, extensible, very fast dynamic code generation system. In PLDI96 [14], pages 160\u2013170.","DOI":"10.1145\/231379.231411"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0304-3975(82)90111-6","volume":"18","author":"A. Ershov","year":"1982","unstructured":"A. Ershov. Mixed computation: The potential applications and problems for study. Theoretical Computer Science, 18:41\u201367, 1982.","journal-title":"Theoretical Computer Science"},{"key":"8_CR7","unstructured":"M. Hall. Managing Interprocedural Optimization. PhD thesis, Department of Computer Science, Rice University, 1991."},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1145\/151640.151643","volume":"1","author":"M. Hall","year":"1992","unstructured":"M. Hall and K. Kennedy. Efficient call graph analysis. Letters on Programming Languages and Systems, 1(3):227\u2013242, September 1992.","journal-title":"Letters on Programming Languages and Systems"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"P. Havlak. Construction of Thinned Gated Single-Assignment form. In U. Banerjee, D. Gelernter, A. Nicolau, and D. A. Padua, editors, Languages and Compilers for Parallel Computing, number 768 in Lecture Notes in Computer Science, pages 477\u2013499. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57659-2_28"},{"key":"8_CR10","unstructured":"D. Keppel. Runtime Code Generation. PhD thesis, University of Washington Department of Computer Science and Engineering, Mar. 1996."},{"key":"8_CR11","unstructured":"D. Keppel, S. Eggers, and R. Henry. Evaluating runtime-compiled value-specific optimizations. Technical Report UWCSE 93-11-02, University of Washington Department of Computer Science and Engineering, November 1993."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"P. Lee and M. Leone. Optimizing ML with run-time code generation. In PLDI96 [14], pages 137\u2013148.","DOI":"10.1145\/231379.231407"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"U. J\u00f8rring and W. L. Scherlis. Compilers and staging transformations. In Conf. Record 13th Annual ACM Symp. on Principles of Programming Languages, pages 86\u201396, St. Petersburg Beach, Jan. 1986.","DOI":"10.1145\/512644.512652"},{"key":"8_CR14","unstructured":"Proceedings ACM SIGPLAN '96 Conf. on Programming Language Design and Implementation, Philadelphia, PA, May 1996."},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/103135.103136","volume":"13","author":"M. N. Wegman","year":"1991","unstructured":"M. N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. ACM Trans. on Programming Languages and Systems, 13(2):181\u2013210, Apr. 1991.","journal-title":"ACM Trans. on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:45:28Z","timestamp":1586573128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630913","9783540691280"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0017249","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}