Code compression

  • Authors:
  • Saumya Debray

  • Affiliations:
  • Department of Computer Science, University of Arizona, Tucson, AZ

  • Venue:
  • PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Increasingly, we see a trend where programmeable processors are incorporated into a wide variety of everyday devices, ranging from “smart badges,” copy and fax machines, phones, and automobiles to traffic lights and wireless sensor networks. At the same time, the functionality expected of the software deployed on such processors becomes increasingly complex (e.g., general-purpose operating systems such as Linux on cell phones, intrusion-detection and related security security measures on wireless sensor devices). The increasing complexity of such software, and the reliability expected of them, suggest a plausible application of declarative languages. However, programs in declarative languages very often experience a significant increase in code size when they are compiled down to native code. This can be a problem in situations where the amount of memory available is limited. This talk discusses a number of different techniques for reducing the memory footprint of executables.