Automatic generation of peephole superoptimizers

ACM SIGPLAN Notices

Volumn 41, Issue 11, 2006, Pages 394-403

  Bansal, Sorav ^a   Aiken, Alex ^a  

^a Stanford University   (United States)

Author keywords

Code selection; Peephole optimization; Superoptimization

Indexed keywords

DATABASE SYSTEMS; PATTERN RECOGNITION; PROGRAM COMPILERS;

CODE SELECTION; HUMAN-WRITTEN PATTERN MATCHING RULES; PEEPHOLE OPTIMIZATION;

OPTIMIZATION;

EID: 33846494229     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1168918.1168906     Document Type: Conference Paper

References (13)

1. Intel C++ Compiler 9.0. Software available at http://www.intel.com/ software/products/compilers/clin.
2. Superoptimizer prototype. Available on the web at http://cs.Stanford.edu/ ~sbansal/superoptimizer/.
3. B. Anckaert, F. Vandeputte, B. D. Bus, B. D. Sutler, and K. D. Bosschere. Link-time optimization of ia64 binaries. In Proceedings of the 10th International Euro-par Conference, pages 211-220, 2004.
4. M. E. Benitez and J. W. Davidson. A portable global optimizer and linker. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, pages 329-338, 1988.
5. J. Davidson and C. Fraser. Code selection through object code optimization. ACM Transactions on Programming Languages and Systems (TOPLAS), 6(4):505-526, 1984.
6. T. Granlund and R. Kenner. Eliminating branches using a superoptimizer and the gnu C compiler. In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, volume 27, pages 341-352, San Francisco, CA, June 1992.
7. J. L. Henning. SPEC CPU2000: Measuring CPU performance in the new millenium. IEEE Computer, 33(7):28-35, July 2000.
8. R. Joshi, G. Nelson, and K. H. Randall. Denali: A goal-directed superoptimizer. In Proceedings of the ACM SIGPLAN '02 Conference on Programming Language Design and Implementation, pages 304-314, Berlin, Germany, June 2002.
9. X. Leroy, D. Doligez, J. Garrigue, and J. Vouillon. The Objective Caml system. Software and documentation available at http://caml.inria.fr.
10. H. Massalin. Superoptimizer: A look at the smallest program. In Second International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS II), pages 122-126, 1987.
11. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01), 2001.
12. L. V. Put, D. Chanet, B. D. Bus, B. D. Sutler, and K. D. Bosschere. Diablo: a reliable, retargetable and extensible link-time rewriting framework. In Proceedings of the 2005 IEEE International Symposium on Signal Processing and Information Technology, pages 7-12, 2005.
13. L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik. Efficient conflict driven learning in boolean satisfiability solver. In ICCAD, pages 279-285, 2001.