{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T21:54:23Z","timestamp":1673474063643},"reference-count":22,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":3893,"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":[[2002,12]]},"DOI":"10.1016\/s1571-0661(04)80605-4","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"156-175","source":"Crossref","is-referenced-by-count":8,"title":["Strategies for Source-to-Source Constant Propagation"],"prefix":"10.1016","volume":"70","author":[{"given":"Karina","family":"Olmos","sequence":"first","affiliation":[]},{"given":"Eelco","family":"Visser","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB1","series-title":"\u201cCompilers: Principles, Techniques, and Tools\u201d","author":"Aho","year":"1986"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB2","series-title":"\u201cModern compiler implementation in ML\u201d","author":"Appel","year":"1998"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB3","unstructured":"Assmann U., How To Uniformly Specify Program Analysis and Transformation, in: T. Gyim\u00f3thy, editor, International Conference on Compiler Construction (CC'96), Lecture Notes in Computer Science 1060 (1996), pp. 121\u2013135."},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB4","unstructured":"Bagge O., M. Haveraaen and E. Visser, CodeBoost: A framework for the transformation of C++ programs, Technical Report UU-CS-2001-32, Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands (2001)."},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Binkley D., Interprocedural constant propagation using dependence graphs and a data-flow model, in: P. A. Fritzson, editor, International Conference on Compiler Construction (CC'94), Lecture Notes in Computer Science 786 (1994), pp. 374\u2013388.","DOI":"10.1007\/3-540-57877-3_25"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB6","series-title":"Rewriting Techniques and Applications (RTA'02)","first-page":"237","article-title":"Rewriting strategies for instruction selection","author":"Bravenboer","year":"2002"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Carini, P. R. and M. Hind, Flow-sensitive interprocedural constant propagation, in: Proceedings of the ACM SIGPLAN'95 Conference on Programming Language Design and Implementation (PLDI), La Jolla, California, SIGPLAN Notices 30\/6, 1995, pp. 23\u201331.","DOI":"10.1145\/223428.207113"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB8","series-title":"Workshop on Language Descriptions, Tools and Applications (LDTA'02)","article-title":"Building interpreters with rewriting strategies","author":"Dolstra","year":"2002"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Drape S., O. de Moor and G. Sittampalam, Transforming the .NET intermediate language using path logic programming, in: C. Kirchner, editor, Proceedings of the Fourth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02), ACM, Pittsburgh, Pensylvania, USA, 2002, pp. 133\u2013144.","DOI":"10.1145\/571157.571171"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB10","series-title":"Partial Evaluation","first-page":"137","article-title":"A roadmap to metacomputation by supercompilation","author":"Gl\u00fcck","year":"1996"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB11","doi-asserted-by":"crossref","unstructured":"Knoop J., O. Ruthing and B. Steffen, Partial dead code elimination, in: SIGPLAN Conference on Programming Language Design and Implementation, 1994, pp. 147\u2013158.","DOI":"10.1145\/178243.178256"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Lacey D. and O. de Moor, Imperative program transformation by rewriting, in: R. Wilhelm, editor, Proceedings of the 10th International Conference on Compiler Construction, Lecture Notes in Computer Science 2027 (2001), pp. 52\u201368.","DOI":"10.1007\/3-540-45306-7_5"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB13","doi-asserted-by":"crossref","unstructured":"Lerner S., D. Grove and C. Chambers, Combining dataflow analyses and transformations, in: SIGPLAN Symposium on Principles of Programming Languages (POPL 2002), Portland, Oregon, 2002, pp. 270\u2013282.","DOI":"10.1145\/503272.503298"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB14","series-title":"\u201cAdvanced compiler design and implementation\u201d","author":"Muchnick","year":"1997"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB15","series-title":"Partial Evaluation","first-page":"430","article-title":"Specialization of imperative programs through analysis of relational expressions","author":"Sakharov","year":"1996"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB16","unstructured":"Standford Compiler Group, The SUIF library, 1.0 edition (1994)."},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB17","doi-asserted-by":"crossref","unstructured":"Stoltz E., M. Wolfe and M. Gerlek, Constant propagation: A fresh demanddriven look, in: Proceedings of ACM Symposium on Applied Computing, ACM SIGAPP (1994), pp. 400\u2013404.","DOI":"10.1145\/326619.326791"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB18","series-title":"Rule Based Programming (RULE'01)","article-title":"Scoped dynamic rewrite rules","author":"Visser","year":"2001"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB19","series-title":"Rewriting Techniques and Applications (RTA'01)","first-page":"357","article-title":"Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5","author":"Visser","year":"2001"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB20","doi-asserted-by":"crossref","unstructured":"Visser E., Z.-e.-A. Benaissa and A. Tolmach, Building program optimizers with rewriting strategies, in: Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP'98) (1998), pp. 13\u201326.","DOI":"10.1145\/289423.289425"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB21","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/103135.103136","article-title":"Constant propagation with conditional branches","volume":"13","author":"Wegman","year":"1991","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)80605-4_NEWBIB22","series-title":"\u201cSUIF: An Infrastructure for Research on Parallelizing and Optimizing Compilers\u201d","author":"Wilson","year":"1996"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T05:54:11Z","timestamp":1549173251000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104806054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S1571066104806054"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80605-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}