Denali: A practical algorithm for generating optimal code

Authors:
Rajeev Joshi;Greg Nelson;Yunhong Zhou
Affiliations:
HP Laboratories, Pasadena, CA;HP Laboratories, Palo Alto, CA;HP Laboratories, Palo Alto, CA
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
2006

Citing 5
Cited 5

Superoptimizer: a look at the smallest program

ASPLOS II Proceedings of the second international conference on Architectual support for programming languages and operating systems
Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
Denali: a goal-directed superoptimizer

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
A Discipline of Programming

A Discipline of Programming
Simplify: a theorem prover for program checking

Journal of the ACM (JACM)

Automatically generating instruction selectors using declarative machine descriptions

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Software synthesis procedures

Communications of the ACM
Test-case reduction for C compiler bugs

Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
IR-level versus machine-level if-conversion for predicated architectures

Proceedings of the 10th Workshop on Optimizations for DSP and Embedded Systems
Data-driven equivalence checking

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications

Quantified Score

Hi-index	0.02

Visualization

Abstract

This article presents a design for the Denali-2 superoptimizer, which will generate minimum-instruction-length machine code for realistic machine architectures using automatic theorem-proving technology: specifically, using E-graph matching (a technique for pattern matching in the presence of equality information) and Boolean satisfiability solving.This article presents a precise definition of the underlying automatic programming problem solved by the Denali-2 superoptimizer. It sketches the E-graph matching phase and presents a detailed exposition and proof of soundness of the reduction of the automatic programming problem to the Boolean satisfiability problem.