Equality saturation: A new approach to optimization

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2009, Pages 264-276

  Tate, Ross ^a   Stepp, Michael ^a   Tatlock, Zachary ^a   Lerner, Sorin ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Compiler optimization; Equality reasoning; Intermediate representation

Indexed keywords

COMPILER OPTIMIZATION; EQUALITY ANALYSIS; EQUALITY REASONING; INPUT PROGRAMS; INTERMEDIATE REPRESENTATION; INTERMEDIATE REPRESENTATIONS; NEW APPROACHES; OPTIMIZER; OPTIMIZERS; PROGRAM FRAGMENTS; TIME AND SPACE; TRANSLATION VALIDATION;

COMPUTATIONAL GRAMMARS; GLOBAL OPTIMIZATION; HEURISTIC METHODS; HEURISTIC PROGRAMMING; OPTIMIZATION; PROGRAM TRANSLATORS;

PROGRAM COMPILERS;

EID: 67649855320     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1480881.1480915     Document Type: Conference Paper

References (42)

1. L. Almagor, K. D. Cooper, A. Grosul, T. J. Harvey, S. W. Reeves, D. Subramanian, L. Torczon, and T. Waterman. Finding effective compilation sequences. In LCTES, 2004.
2. B. Alpern,M.Wegman, and F. Zadeck. Detecting equality of variables in programs. In POPL, January 1988.
3. E. A. Ashcroft and W. W. Wadge. Lucid, a nonprocedural language with iteration. Communications of the ACM, 20(7):519-526, 1977.
4. S. Bansal and A. Aiken. Automatic generation of peephole superoptimizers. In ASPLOS, 2006. (Pubitemid 46160741)
5. R. Bird and P. Wadler. Introduction to Functional Programming. Prentice Hall, 1988.
6. James M. Boyle, Terence J. Harmer, and Victor L. Winter. The TAMPR program transformation system: simplifying the development of numerical software. Modern software tools for scientific computing, pages 353-372, 1997.
7. M. Bravenboer, K. T. Kalleberg, R. Vermaas, and E. Visser. Stratego/XT 0.17. A language and toolset for program transformation. Science of Computer Programming, 72(1-2):52-70, 2008.
8. K. D. Cooper C. Click. Combining analyses, combining optimizations. Transactions on Programming Languages and Systems, 17(2):181-196, 1995.
9. C. Click. Global code motion/global value numbering. In PLDI, June 1995.
10. K. D. Cooper, P. J. Schielke, and Subramanian D. Optimizing for reduced code space using genetic algorithms. In LCTES, 1999. (Pubitemid 129685526)
11. R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. An efficient method for computing static single assignment form. In POPL, January 1989.
12. Jeffrey Dean and Craig Chambers. Towards better inlining decisions using inlining trials. In Conference on LISP and Functional Programming, 1994.
13. D. Detlefs, G. Nelson, and J. Saxe. Simplify: A theorem prover for program checking. Journal of the Association for Computing Machinery, 52(3):365-473, May 2005. (Pubitemid 43078377)
14. E. Dijkstra. Go to statement considered harmful. pages 27-33, 1979.
15. J. Ferrante, K. Ottenstein, and J. Warren. The program dependence graph and its use in optimization. Transactions on Programming Languages and Systems, 9(3):319-349, July 1987. (Pubitemid 17641083)
16. Christopher W. Fraser, Robert R. Henry, and Todd A. Proebsting. BURG - fast optimal instruction selection and tree parsing. SIGPLAN Notices, 27(4):68-76, April 1992.
17. J. Giarratano and G. Riley. Expert Systems - Principles and Programming. PWS Publishing Company, 1993.
18. Torbjorn Granlund and Richard Kenner. Eliminating branches using a superoptimizer and the GNU C compiler. In PLDI, 1992. (Pubitemid 23626340)
19. P. Havlak. Construction of thinned gated single-assignment form. In Workshop on Languages and Compilers for Parallel Computing, 1993. (Pubitemid 24767105)
20. W. M. Johnston, J. R. P. Hanna, and R. J. Millar. Advances in dataflow programming languages. ACMComputing Surveys, 36(1):1-34, 2004.
21. R. Joshi, G. Nelson, and K. Randall. Denali: a goal-directed superoptimizer. In PLDI, June 2002. (Pubitemid 34991528)
22. L. Torczon K. D. Cooper, D. Subramanian. Adaptive optimizing compilers for the 21st century. The Journal of Supercomputing, pages 7-22, 2002. (Pubitemid 34772138)
23. S. Lerner, D. Grove, and C. Chambers. Composing dataflow analyses and transformations. In POPL, January 2002. (Pubitemid 35009048)
24. Henry Massalin. Superoptimizer: a look at the smallest program. In ASPLOS, 1987. (Pubitemid 18538644)
25. G. Necula. Translation validation for an optimizing compiler. In PLDI, June 2000. (Pubitemid 32394085)
26. G. Nelson and D. Oppen. Simplification by cooperating decision procedures. Transactions on Programming Languages and Systems, 1(2):245-257, October 1979.
27. G. Nelson and D. Oppen. Fast decision procedures based on congruence closure. Journal of the Association for Computing Machinery, 27(2):356-364, April 1980. (Pubitemid 11428851)
28. K. Ottenstein, R. Ballance, and A. MacCabe. The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages. In PLDI, June 1990.
29. K. Pengali, M. Beck, and R. Johson. Dependence flow graphs: an algebraic approach to program dependencies. In POPL, January 1991.
30. A. Pnueli, M. Siegel, and E. Singerman. Translation validation. In TACAS, 1998. (Pubitemid 128055542)
31. H. Sheini and K. Sakallah. Pueblo: A hybrid pseudo-boolean SAT solver. Journal on Satisfiability, Boolean Modeling and Computation, 2:61-96, 2006.
32. B. Steffen, J. Knoop, and O. Ruthing. The value flow graph: A program representation for optimal program transformations. In European Symposium on Programming, 1990.
33. Ross Tate, Michael Stepp, Zachary Tatlock, and Sorin Lerner. Translating between PEGs and CFGs. Technical Report CS2008- 0931, University of California, San Diego, November 2008.
34. P. Tu and D. Padua. Efficient building and placing of gating functions. In PLDI, June 1995.
35. R. Vallée-Rai, L. Hendren, V. Sundaresan, P. Lam, E. Gagnon, and P. Co. Soot - a Java optimization framework. In CASCON, 1999.
36. M. G. J. van den Brand, J. Heering, P. Klint, and P. A. Olivier. Compiling language definitions: the ASF+SDF compiler. Transactions on Programming Languages and Systems, 24(4), 2002.
37. E. Visser, Z. Benaissa, and A Tolmach. Building program optimizers with rewriting strategies. In ICFP, 1998.
38. D. Weise, R. Crew, M. Ernst, and B. Steensgaard. Value dependence graphs: Representation without taxation. In POPL, 1994.
39. Debbie Whitfield and Mary Lou Soffa. An approach to ordering optimizing transformations. In PPOPP, 1990.
40. Deborah L.Whitfield and Mary Lou Soffa. An approach for exploring code improving transformations. Transactions on Programming Languages and Systems, 19(6):1053-1084, November 1997. (Pubitemid 127455643)
41. B. Xin, W. N. Sumner, and X. Zhang. Efficient program execution indexing. In PLDI, June 2008.
42. Lenore Zuck, Amir Pnueli, Yi Fang, and Benjamin Goldberg. VOC: A methodology for the translation validation of optimizing compilers. Journal of Universal Computer Science, 9(3):223-247, March 2003. (Pubitemid 41151351)