Denali
Authors:
Open Access
- 17 May 2002
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 37 (5) , 304-314
Abstract
This paper provides a preliminary report on a new research project that aims to construct a code generator that uses an automatic theorem prover to produce very high-quality (in fact, nearly mathematically optimal) machine code for modern architectures. The code generator is not intended for use in an ordinary compiler, but is intended to be used for inner loops and critical subroutines in those cases where peak performance is required, no available compiler generates adequately efficient code, and where current engineering practice is to use hand-coded machine language. The paper describes the design of the superoptimizer, and presents some encouraging preliminary results.Keywords
This publication has 6 references indexed in Scilit:
- Extended static checking for Java2002
- Eliminating branches using a superoptimizer and the GNU C compiler1992
- Performance of the Firefly RPCACM Transactions on Computer Systems, 1990
- Superoptimizer: a look at the smallest program1987
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980