Denali-Reference-Cited by-同舟云学术

Denali

Published:2006-11 Issue:6 Volume:28 Page:967-989
ISSN:0164-0925
Container-title:ACM Transactions on Programming Languages and Systems
language:en
Short-container-title:ACM Trans. Program. Lang. Syst.

Author:

Joshi Rajeev¹,Nelson Greg²,Zhou Yunhong²

Affiliation:

1. HP Laboratories, Pasadena, CA

2. HP Laboratories, Palo Alto, CA

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Software

Link

https://dl.acm.org/doi/pdf/10.1145/1186632.1186633

Reference5 articles.

1. Simplify: a theorem prover for program checking

2. Dijkstra E. W. 1976. A Discipline of Programming. Prentice Hall Englewood Cliffs NJ. Dijkstra E. W. 1976. A Discipline of Programming. Prentice Hall Englewood Cliffs NJ.

3. Variations on the Common Subexpression Problem

4. Denali

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques;Proceedings of the ACM on Programming Languages;2024-06-20

2. Architecture-Aware Optimization Strategies for Instruction Selection in DSP Compilers;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2024

3. Grafs: declarative graph analytics;Proceedings of the ACM on Programming Languages;2021-08-22

4. Practical verification of peephole optimizations with Alive;Communications of the ACM;2018-01-23

5. Alive-Infer: data-driven precondition inference for peephole optimizations in LLVM;ACM SIGPLAN Notices;2017-09-14