Code compression

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The use of classical compiler optimizations to reduce the size of the generated code was discussed. Code size reduction is possible using techniques for code factoring, which aims to reduce code size by getting rid of repeated code fragments. Classical optimizations, coupled with code factoring, gives code size reductions of around 30% on average. An orthogonal direction to code size reduction involves dynamic code mutation.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science
EditorsM. Hermenegildo, D. Cabeza
Pages5-6
Number of pages2
Volume3350
Publication statusPublished - 2005
Event7th International Symposium on Practical Aspects of Declarative Languages, PADL 2005 - Long Beach, CA, United States
Duration: Jan 10 2005Jan 11 2005

Other

Other7th International Symposium on Practical Aspects of Declarative Languages, PADL 2005
CountryUnited States
CityLong Beach, CA
Period1/10/051/11/05

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Debray, S. K. (2005). Code compression. In M. Hermenegildo, & D. Cabeza (Eds.), Lecture Notes in Computer Science (Vol. 3350, pp. 5-6)