Denali: A practical algorithm for generating optimal code

ACM Transactions on Programming Languages and Systems

Volumn 28, Issue 6, 2006, Pages 967-989

  Joshi, Rajeev ^a,b   Nelson, Greg ^a,c   Zhou, Yunhong ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c NONE   (United States)

Author keywords

Code generation; Compilation; Practical optimal code generation

Indexed keywords

AUTOMATIC PROGRAMMING; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; PROGRAM COMPILERS;

E-GRAPH MATCHING; PRACTICAL OPTIMAL CODE GENERATION;

CODES (SYMBOLS);

EID: 33845521509     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1186632.1186633     Document Type: Article

References (5)

1. DETLEFS, D. L., NELSON, G., AND SAXE, J. P. 2003. Simplify: A theorem-prover for program checking. JACM, to appear.
2. DIJKSTRA, E. W. 1976. A Discipline of Programming. Prentice Hall, Englewood Cliffs, NJ.
3. DOWNEY, P. J., SETHI, R., AND TARJAN, R. E. 1980. Variations on the common subexpression problem. JACM, 27, 4 (Oct.), 758-771.
4. JOSHI, R., NELSON, G., AND RANDALL, K. 2002. Denali: A goal-directed superoptimizer. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (Berlin, Germany, June). ACM, New York, 304-314.
5. MASSALIN, H. 1987. Superoptimizer: A look at the shortest program. Proceedings of the Second International Conference on Architectural Support for Programming Languages and Operating Systems, 122-26.