Equality saturation: A new approach to optimization

Logical Methods in Computer Science

Volumn 7, Issue 1, 2011, Pages

  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

GLOBAL OPTIMIZATION; HEURISTIC PROGRAMMING; PROGRAM TRANSLATORS;

COMPILER OPTIMIZATIONS; EQUALITY ANALYSIS; EQUALITY REASONING; INTERMEDIATE REPRESENTATIONS; NEW APPROACHES; PROGRAM FRAGMENTS; SPACE OVERHEAD; TRANSLATION VALIDATION;

PROGRAM COMPILERS;

EID: 79955429500     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-7(1:10)2011     Document Type: Article

References (62)

1. SAT4J. http://www.sat4j.org/.
2. C++0x draft standard, 2010. http://www.open-td.org/jtc1/sc22/wg21/docs/papers/2010/n3126.pdf, page 130.
3. Embedded in Academia, 2010. http://blog.regehr.org/archives/140.
4. 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.
5. B. Alpern, M. Wegman, and F. Zadeck. Detecting equality of variables in programs. In POPL, January 1988.
6. A. Appel. Compiling with Continuations. Cambridge University Press, 1991.
7. A. Appel and J. Palsberg. Modern Compiler Implementation in Java. Cambridge University Press, 2002.
8. Andrew W. Appel and Trevor Jim. Shrinking lambda expressions in linear time. Journal of Functional Programming, 7(5):515-540, 1997.
9. E. A. Ashcroft and W. W. Wadge. Lucid, a nonprocedural language with iteration. Communications of the ACM, 20(7):519-526, 1977.
10. John C. Baez and Mike Stay. Physics, topology, logic and computation: A rosetta stone. http://arxiv.org/abs/0903.0340. Mar 2009.
11. S. Bansal and A. Aiken. Automatic generation of peephole superoptimizers. In ASPLOS, 2006.
12. Yves Bertot and Pierre Castéran. Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Springer Verlag, 2004.
13. 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.
14. 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.
15. K. D. Cooper C. Click. Combining analyses, combining optimizations. Transactions on Programming Languages and Systems, 17(2):181-196, 1995.
16. C. Click. Global code motion/global value numbering. In PLDI, June 1995.
17. K. D. Cooper, P. J. Schielke, and Subramanian D. Optimizing for reduced code space using genetic algorithms. In LCTES, 1999.
18. Pierre-Louis Curien. The joy of string diagrams. In CSL '08: Proceedings of the 22nd international workshop on Computer Science Logic, pages 15-22, Berlin, Heidelberg, 2008. Springer-Verlag.
19. R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. An efficient method for computing static single assignment form. In POPL, January 1989.
20. Jeffrey Dean and Craig Chambers. Towards better inlining decisions using inlining trials. In Conference on LISP and Functional Programming, 1994.
21. 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.
22. E. Dijkstra. Go to statement considered harmful. Communications of the ACM, 11(3):147-148, 1968.
23. th International Conference on Theory and Application of Satisfiability Testing (SAT), 2005.
24. 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.
25. Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The essence of compiling with continuations. In PLDI '93: Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation, pages 237-247, New York, NY, USA, 1993. ACM.
26. 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.
27. Harold N. Gabow and Robert Endre Tarjan. A linear-time algorithm for a special case of disjoint set union. In STOC '83: Proceedings of the fifteenth annual ACM symposium on Theory of computing, pages 246-251, New York, NY, USA, 1983. ACM.
28. J. Giarratano and G. Riley. Expert Systems - Principles and Programming. PWS Publishing Company, 1993.
29. Torbjorn Granlund and Richard Kenner. Eliminating branches using a superoptimizer and the GNU C compiler. In PLDI, 1992.
30. John Hatcliff and Olivier Danvy. A generic account of continuation-passing styles. In POPL '94: Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 458-471, New York, NY, USA, 1994. ACM.
31. P. Havlak. Construction of thinned gated single-assignment form. In Workshop on Languages and Com- pilers for Parallel Computing, 1993.
32. W. M. Johnston, J. R. P. Hanna, and R. J. Millar. Advances in dataflow programming languages. ACM Computing Surveys, 36(1):1-34, 2004.
33. R. Joshi, G. Nelson, and K. Randall. Denali: a goal-directed superoptimizer. In PLDI, June 2002.
34. L. Torczon, K. D. Cooper, D. Subramanian. Adaptive optimizing compilers for the 21st century. The Journal of Supercomputing, pages 7-22, 2002.
35. Andrew Kennedy. Compiling with continuations, continued. In ICFP '07: Proceedings of the 12th ACM SIGPLAN international conference on Functional programming, pages 177-190, New York, NY, USA, 2007. ACM.
36. P. J. Landin. The mechanical evaluation of expressions. Computer Journal, 6(4):308-320, 1963.
37. Daan Leijen. A type directed translation of MLF to System F. In The International Conference on Functional Programming (ICFP'07). ACM Press, October 2007.
38. S. Lerner, D. Grove, and C. Chambers. Composing dataflow analyses and transformations. In POPL, January 2002.
39. Henry Massalin. Superoptimizer: a look at the smallest program. In ASPLOS, 1987.
40. G. Necula. Translation validation for an optimizing compiler. In PLDI, June 2000.
41. G. Nelson and D. Oppen. Simplification by cooperating decision procedures. Transactions on Program- ming Languages and Systems, 1(2):245-257, October 1979.
42. G. Nelson and D. Oppen. Fast decision procedures based on congruence closure. Journal of the Asso- ciation for Computing Machinery, 27(2):356-364, April 1980.
43. 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.
44. K. Pengali, M. Beck, and R. Johson. Dependence flow graphs: an algebraic approach to program dependencies. In POPL, January 1991.
45. A. Pnueli, M. Siegel, and E. Singerman. Translation validation. In TACAS, 1998.
46. W. Quine. Word and Object. Simon and Schuster, New York, 1964.
47. H. Sheini and K. Sakallah. Pueblo: A hybrid pseudo-boolean SAT solver. Journal on Satisfiability, Boolean Modeling and Computation, 2:61-96, 2006.
48. B. Steffen, J. Knoop, and O. Ruthing. The value flow graph: A program representation for optimal program transformations. In European Symposium on Programming, 1990.
49. Christopher Strachey. Fundamental concepts in programming languages. Com- put., 13(1-2):11-49, 2000.
50. Ross Tate, Michael Stepp, Zachary Tatlock, and Sorin Lerner. Translating between PEGs and CFGs. Technical report, University of California, San Diego, October 2010.
51. P. Tu and D. Padua. Efficient building and placing of gating functions. In PLDI, June 1995.
52. R. Vallée-Rai, L. Hendren, V. Sundaresan, P. Lam, E. Gagnon, and P. Co. Soot - a Java optimization framework. In CASCON, 1999.
53. 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.
54. E. Visser, Z. Benaissa, and A Tolmach. Building program optimizers with rewriting strategies. In ICFP, 1998.
55. Philip Wadler. Comprehending monads. In LFP '90: Proceedings of the 1990 ACM conference on LISP and functional programming, pages 61-78, New York, NY, USA, 1990. ACM.
56. Philip Wadler. Monads for functional programming. In Advanced Functional Programming, First Inter- national Spring School on Advanced Functional Programming Techniques-Tutorial Text, pages 24-52, London, UK, 1995. Springer-Verlag.
57. Philip Wadler. The marriage of effects and monads. In ICFP '98: Proceedings of the third ACM SIG- PLAN international conference on Functional programming, pages 63-74, New York, NY, USA, 1998. ACM.
58. D. Weise, R. Crew, M. Ernst, and B. Steensgaard. Value dependence graphs: Representation without taxation. In POPL, 1994.
59. Debbie Whitfield and Mary Lou Soffa. An approach to ordering optimizing transformations. In PPOPP, 1990.
60. 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.
61. B. Xin, W. N. Sumner, and X. Zhang. Efficient program execution indexing. In PLDI, June 2008.
62. 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.