A Space Optimization Using Inexact Instruction Matches

In this paper we examine parameterized procedural abstraction. This is an extension of an optimization whose sole purpose is to reduce code size. Previously published implementations of procedural abstraction have produced space savings if the instruction sequences are exact matches. We show that permanent space savings (compaction) are possible when (1) covering all inexact matches by several procedures and (2) carefully choosing the inexact match instances covered by each procedure. Our algorithms yield substantially better space savings in comparison to approaches constrained to use unparameterized procedures. 1 Introduction Powerful applications that are small and fast have always been desirable. Falling memory prices and higher chip densities mean that internal storage constraints should (theoretically) recede into the background. However, many computer users are unsatisfied as they often find that there is never enough memory for their programs. Compiler optimizations are usual..