Compiling with code-size constraints
ACM Transactions on Embedded Computing Systems2004Vol. 3(1), pp. 163–181
Citations Over TimeTop 10% of 2004 papers
Abstract
Most compilers ignore the problems of limited code space in embedded systems. Designers of embedded software often have no better alternative than to manually reduce the size of the source code or even the compiled code. Besides being tedious and error prone, such optimization results in obfuscated code that is difficult to maintain and reuse. In this paper, we present a step towards code-size-aware compilation. We phrase register allocation and code generation as an integer linear programming problem where the upper bound on the code size can simply be expressed as an additional constraint. The resulting compiler, when applied to six commercial microcontroller programs, generates code nearly as compact as carefully crafted code.
Related Papers
- → Compiling with code-size constraints(2004)19 cited
- → Compiling with code-size constraints(2002)27 cited
- → An Efficient Code Generation Algorithm for Code Size Reduction Using 1-Offset P-Code Queue Computation Model(2007)5 cited
- → Compiling with code-size constraints(2002)
- → Compiling with code-size constraints(2002)