Building the world from first principles: declarative machine descriptions and compiler construction

Authors:
Norman Ramsey
Affiliations:
Division of Engineering and Applied Sciences, Harvard University
Venue:
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Year:
2005

Citing 11
Cited 0

Code selection through object code optimization

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
A portable global optimizer and linker

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A simple solver for linear equations containing nonlinear operators

Software—Practice & Experience
Relocating machine instructions by currying

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Automatic checking of instruction specifications

ICSE '97 Proceedings of the 19th international conference on Software engineering
Specifying representations of machine instructions

ACM Transactions on Programming Languages and Systems (TOPLAS)
A transformational approach to binary translation of delayed branches

ACM Transactions on Programming Languages and Systems (TOPLAS)
Machine Descriptions to Build Tools for Embedded Systems

LCTES '98 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
Pragmatic aspects of reusable program generators

Journal of Functional Programming
A generalized algorithm for graph-coloring register allocation

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
The New Jersey machine-code toolkit

TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings

Quantified Score

Hi-index	0.00

Visualization

Abstract

For at least 25 years, the most effective way to retarget systems software has been by using machine descriptions. But “machine description” doesn’t mean what you think. A traditional machine description does contain information about the machine, but its utility is compromised in one of two ways: The description is useful only in support of a particular algorithm, such as instruction-set emulation, LR parsing, or bottom-up tree matching. Information about the machine is inextricably intertwined with information about a particular tool’s internal representation, such as a compiler’s intermediate code.