Strategies for source-to-source constant progagation

Electronic Notes in Theoretical Computer Science

Volumn 70, Issue 6, 2002, Pages 156-175

  Olmos, Karina ^a   Visser, Eelco ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; OPTIMIZATION; PROBLEM SOLVING; PROGRAM COMPILERS; SYNTACTICS; TREES (MATHEMATICS);

ABSTRACT SYNTAX TREES; DATA FLOW; DYNAMIC REWRITING; REWRITING SYSTEMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 18244404252     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80605-4     Document Type: Conference Paper

References (22)

1. Aho A., Sethi R., Ullman J. "Compilers: Principles, Techniques, and Tools" 1986;Addison-Wesley
2. Appel A. "Modern compiler implementation in ML" 1998;Cambridge University Press
3. Assmann U., How To Uniformly Specify Program Analysis and Transformation, in: T. Gyimóthy, editor, International Conference on Compiler Construction (CC'96), Lecture Notes in Computer Science 1060 (1996), pp. 121-135.
4. 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).
5. 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-388.
6. Bravenboer M., Visser E. Rewriting strategies for instruction selection. Tison S. Rewriting Techniques and Applications (RTA'02). Lecture Notes in Computer Science 2378 :2002;237-251
7. 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-31.
8. Dolstra E., Visser E. Building interpreters with rewriting strategies. van den Brand M., Laemmel R. Workshop on Language Descriptions, Tools and Applications (LDTA'02). Electronic Notes in Theoretical Computer Science 65/3 :2002
9. 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-144.
10. Glück R., Sørensen M.H. A roadmap to metacomputation by supercompilation. Danvy O., Glück R., Thiemann P. Partial Evaluation. Lecture Notes in Computer Science 1110 :1996;137-160
11. Knoop J., O. Ruthing and B. Steffen, Partial dead code elimination, in: SIGPLAN Conference on Programming Language Design and Implementation, 1994, pp. 147-158.
12. 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-68.
13. 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-282.
14. Muchnick S. "Advanced compiler design and implementation" 1997;Morgan Kaufmann Publishers
15. Sakharov A. Specialization of imperative programs through analysis of relational expressions. Danvy O., Glück R., Thiemann P. Partial Evaluation. Lecture Notes in Computer Science 1110 :1996;430-445
16. Standford Compiler Group, The SUIF library, 1.0 edition (1994).
17. 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-404.
18. Visser E. Scoped dynamic rewrite rules. van den Brand M., Verma R. Rule Based Programming (RULE'01). Electronic Notes in Theoretical Computer Science 59/4 :2001
19. Visser E. Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5. Middeldorp A. Rewriting Techniques and Applications (RTA'01). Lecture Notes in Computer Science 2051 :2001;357-361
20. 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-26.
21. Wegman M., Zadeck F. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems. 13:1991;181-210
22. Wilson R., French R., Wilson C., Amarasinghe S., Anderson J., Tjiang S., Liao S., Tseng C., Hall M., Lam M., Hennessy J. "SUIF: An Infrastructure for Research on Parallelizing and Optimizing Compilers" 1996