next up previous
Next: About this document ... Up: codeCompression Previous: codeCompression

Bibliography

1
Kasi Anantha and Fred Long.
Code compaction for parallel architectures.
Software - Practice and Experience, 20(6):537-554, June 1990.

2
Guido Araújo, Paulo Centoducatte, Rodolfo Azevedo, and Ricardo Pannain.
Expression tree based algorithms for code compression on embedded RISC architectures.
Technical Report IC-00-01, Instituto de Computação - UNICAMP, January 2000.

3
Guido Araújo, Paulo Centoducatte, Rodolfo Azevedo, and Ricardo Pannain.
Expression tree based algorithms for code compression on embedded RISC architectures.
IEEE Transactions on VLSI Systems, March 2000.

4
Guido Araújo, Paulo Centoducatte, Mario Côrtes, and Ricardo Pannain.
Code compression based on operand factorization.
In Proc. Int'l Symp. on Microarchitecture, pages 194-201, December 1998.

5
ARM.
An Introduction to Thumb.
Advanced RISC Machines Ltd., March 1995.

6
Benda S. Baker, Udi Manber, and Robert Muth.
Compressing differences of executable code.
In Workshop on Compiler Support for System Software, May 1999.

7
S. Bandyopadhyay, V.S. Begwani, and R.B. Murray.
Compiling for the CRISP microprocessor.
In Proc. Int'l Computer Conference, 1987.

8
I. Baxter, A. Yahin, L. Moura, M. Sant'Anna, and L. Bier.
Clone detection using abstract syntax trees.
In Proc. of the Int'l. Conf. on Software Maintenance, 1998.

9
Martin Benes, Steven M. Nowick, and Andrew Wolfe.
A fast asynchronous Huffman decoder for compressed-code embedded processors.
In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems, September 1998.

10
Martin Benes, Andrew Wolfe, and Steven M. Nowick.
A high-speed asynchronous decompression circuit for embedded processors.
In Proc. Conf. on Advanced Research in VLSI, September 1997.

11
J. P. Bennet.
A Methodology for Automated Design of Computer Instruction Sets.
PhD thesis, University of Cambridge, 1987.

12
J. P. Bennet and G. C. Smith.
The need for reduced byte stream instruction sets.
The Computer Journal, 32:370-373, 1989.

13
A.D. Berenbaum, D.R. Ditzel, and H.R. McLellen.
Architectural innovations in the CRISP microprocessor.
In Proc. Int'l Computer Conference, 1987.

14
A.D. Berenbaum, D.R. Ditzel, and H.R. McLellen.
Introduction to the CRISP instruction set architecture.
In Proc. Int'l Computer Conference, 1987.

15
Árpád Beszédes, Rudolf Ferenc, Tamás Gergely, Tibor Gyimóthy, Gábor Lóki, and László Vidács.
Csibe benchmark: One year perspective and plans.
In Proceedings of the 2004 GCC Developers' Summit, pages 7-15, June 2004.

16
Árpád Beszédes, Rudolf Ferenc, Tibor Gyimóthy, André Dolenc, and Konsta Karsisto.
Survey of code-size reduction methods.
ACM Comput. Surv., 35(3):223-267, 2003.

17
Árpád Beszédes, Tamás Gergely, Tibor Gyimóthy, Gábor Lóki, and László Vidács.
Optimizing for space : Measurements and possibilities for improvement.
In Proceedings of the 2003 GCC Developers' Summit, pages 7-20, May 2003.

18
P. Bird and T. Mudge.
An instruction stream compression technique.
Technical Report CSE-TR-319-96, EECS Department, University of Michigan, November 1996.

19
Mauricio Breternitz Jr. and Roger Smith.
Enhanced compression techniques to symplify program decompression and execution.
In Proc. Int'l Conf. on Computer Design, pages 170-176, October 1997.

20
John D. Bunda, Donald S. Fussell, Roy M. Jenevein, and W. C. Athas.
16-bit vs. 32-bit instructions for pipelined microprocessors.
Technical Report TR-92-39, The University of Texas at Austin, Department of Computer Sciences, 1992.

21
Vincent Cate and Thomas Gross.
Integration of compression and caching for a two-level file system.
In Proc. Symp. on Architectural Support for Programming Languages and Operating Systems, pages 200-211, 1991.

22
Paulo Centoducatte, Ricardo Pannain, and Guido Araújo.
Compressed code execution on DSP architectures.
In Proc. ACM/IEEE Int'l Symp. on System Synthesis, November 1999.

23
I. Chen.
Enhancing Instruction Fetching Mechanism Using Data Compression.
PhD thesis, University of Michigan, 1997.

24
I. Chen, P. Bird, and T. Mudge.
The impact of instruction compression on i-cache performance.
Technical Report CSE-TR-330-97, EECS Department, University of Michigan, 1996.

25
Kuo-Liang Chung.
Efficient Huffman decoding.
Information Processing Letters, 61(2):97-99, February 1997.

26
L. R. Clausen, U. P. Schultz, C. Consel, and G. Muller.
Java bytecode compression for embedded systems.
Technical Report No 1213, Institut de Recherche en Informatique et Systemes Aleatoires, 1998.

27
L. R. Clausen, U. P. Schultz, C. Consel, and G. Muller.
Java bytecode compression for low-end embedded systems.
ACM Transactions on Programming Languages and Systems, 22(3):471-489, 2000.

28
Lars Raeder Clausen, Ulrik Pagh Schultz, Charles Consel, and Gilles Muller.
Java bytecode compression for embedded systems.
Technical Report RR-3578, Inria, Institut National de Recherche en Informatique et en Automatique, 1998.

29
Thomas M. Conte, Sanjeev Banerjia, Sergei Larin, Kishore N. Menezes, and Aumedh W. Sathaye.
Instruction fetch mechanisms for vliw architectures with compressed encodings.
In Proc. Int'l Symp. on Computer Architecture, November 1996.

30
Keith D. Cooper and Nathaniel McIntosh.
Enhanced code compression for embedded RISC processors.
In Proc. Conf. on Programming Languages Design and Implementation, May 1999.

31
Keith D. Cooper, Philip J. Schielke, and Devika Subramanian.
Optimizing for reduced code space using genetic algorithms.
ACM SIGPLAN Notices, 34(7):1-9, July 1999.

32
Jack W. Davidson and Chris W. Fraser.
Eliminating redundant object code.
In Proc. Symp. on Principles of Programming Languages, pages 128-132, 1982.

33
Bjorn de Sutter, Bruno de Bus, Koen de Bosschere, and Saumya Debray.
Combining global code and data compaction.
In Proc. ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems, June 2001.

34
Saumya Debray and William Evans.
Profile-guided code compression.
In Proc. Conf. on Programming Languages Design and Implementation, June 2002.

35
Saumya Debray, William Evans, and Robert Muth.
Compiler techniques for code compression.
In Workshop on Compiler Support for System Software, May 1999.
Note: Preliminary version of article in ACM Transactions on Programming Languages and Systems.

36
Saumya Debray, William Evans, Robert Muth, and Bjorn de Sutter.
Compiler techniques for code compaction.
ACM Transactions on Programming Languages and Systems, 22(2):378-415, 2000.

37
Saumya Debray, William Evans, Robert Muth, and Bjorn de Sutter.
Compiler techniques for code compaction.
Technical Report TR00-04, Department of Computer Science, The University of Arizona, March 2000.

38
D. Ditzel, H.R. McLellan, and A.D. Berenbaum.
The hardware architecture of the CRISP microprocessor.
In Proc. Int'l Symp. on Computer Architecture, June 1987.

39
Danny Dubé.
Un système de programmation Scheme pour micro-contrôleur.
Master's thesis, Université de Montréal, April 1996.

40
Danny Dubé.
BIT: A very compact Scheme system for embedded applications.
In Matthias Felleisen, editor, Proceedings of the Workshop on Scheme and Functional Programming, September 2000.

41
W. Earle.
Compress ROM programs with a math-function interpreter.
Electronic design news, March 1982.

42
Peter Elias.
Interval and recency rank source coding: Two on-line adaptive variable-length schemes.
IEEE Transactions on Information Theory, 33(1), 1987.

43
Jens Ernst, Christopher W. Fraser, William Evans, Steven Lucco, and Todd A. Proebsting.
Code compression.
In Proc. Conf. on Programming Languages Design and Implementation, pages 358-365, June 1997.

44
M. Franz.
Code-Generation On-The-Fly: A Key to Portable Software.
PhD thesis, Swiss Federal Institute of Technology, 1994.

45
M. Franz.
Adaptive compression of syntax trees and iterative dynamic code optimization: Two basic technologies for mobile-object systems.
In Jan Vitek and Christian Tschudi, editors, Mobile Object Systems: Towards the Programmable Internet,, Lecture Notes in Computer Science, pages 263-276. Springer-Verlag, 1997.

46
M. Franz and T. Kistler.
Slim binaries.
Communications of the ACM, 40(12):87-94, December 1997.

47
Michael Franz and Thomas Kistler.
A tree-based alternative to java byte-codes.
techreport 96-58, Department of Information and Computer Science, University of California, Irvine, December 1996.

48
C. Fraser, E. Myers, and A. Wendt.
Analyzing and compressing assembly code.
In Proc. of the ACM SIGPLAN Symposium on Compiler Construction, volume 19, pages 117-121, June 1984.

49
Christopher W. Fraser.
Automatic inference of models for statistical code compression.
In Proc. Conf. on Programming Languages Design and Implementation, pages 242-246, May 1999.

50
Christopher W. Fraser and Will Evans.
Bytecode compression via profiled grammar rewriting.
In Proc. Conf. on Programming Languages Design and Implementation, June 2001.

51
Christopher W. Fraser and Todd A. Proebsting.
Custom instruction sets for code compression.
Unpublished manuscript. http://research.microsoft.com/~toddpro/papers/pldi2.ps, 1995.

52
Christopher W. Fraser and Alan L. Wendt.
Integrating code generation and optimization.
SIGPLAN Notices, 21(7):242-248, June 1986.

53
Gideon Frieder and Harry J. Saal.
A process for the determination of addresses in variable length addressing.
Communications of the ACM, 19(6):335-338, June 1976.

54
Mark Game and Alan Booker.
CodePack: Code Compression for PowerPC Processors.
International Business Machines (IBM) Corporation, 1998.

55
Charles M. Geschke.
Global Program Optimizations.
PhD thesis, Carnegie Mellon University, 1972.

56
David Ruimy Gonzales.
Micro-RISC architecture for the wireless market.
IEEE Micro, 19(4), 1999.

57
David B. Hanson.
Simple code optimization.
Software - Practice and Experience, 13(8):745-763, 1983.

58
Reza Hashemian.
Memory efficient and high-speed search Huffman coding.
IEEE Transactions on Communications, 43(10):2576-2581, October 1997.

59
Eric C. R. Hehner.
Computer design to minimize memory requirements.
Computer, 9(8):65-70, August 1976.

60
Eric C. R. Hehner.
Information content of programs and operation encoding.
Journal of the ACM, 24(2):290-297, April 1977.

61
Bruce K. Holmer and Alvin M. Despain.
Viewing instruction set design as an optimization problem.
In Proceedings of the 24th Annual International Symposium on Microarchitecture, pages 153-162, Albuquerque, New Mexico, November 18-20, 1991. ACM SIGMICRO and IEEE Computer Society TC-MICRO.

62
Jan Hoogerbrugge, Lex Augusteijn, Jeroen Trum, and Rik van de Wiel.
A code compression system based on pipelined interpreters.
Software - Practice and Experience, 29(11), 1999.

63
R. Nigel Horspool and Jason Corless.
Tailored compression of java class files.
Software - Practice and Experience, 28(12):1253-1268, 1999.

64
I.-J. Huang and A. M. Despain.
Generating instruction sets and microarchitectures from applications.
In International Conference on Computer-Aided Design, pages 391-396, Los Alamitos, Ca., USA, November 1994. IEEE Computer Society Press.

65
D.A. Huffman.
A method for construction of minimum redundancy codes.
In Proc. of the IEEE, volume 40, pages 1098-1101, 1952.

66
IBM.
CodePack: PowerPC Code Compression Utility User's Manual. Version 3.0.
International Business Machines (IBM) Corporation, 1998.

67
N. Ishiura and M. Yamaguchi.
Instruction code compression for application specific vliw processors based on automatic field partitioning.
In Proc. of the Workshop on Synthesis and System Integration of Mixed Technologies, pages 105-109, December 1997.

68
T.M. Kemp, R.M. Montoye, J.D. Harper, J.D. Palmer, and D.J. Auerbach.
A decompression core for PowerPC.
IBM Journal of Research and Development, 42(6), Nov 1998.

69
Darko Kirovski, Johnson Kin, and William H. Mangione-Smith.
Procedure based program compression.
In Proc. Int'l Symp. on Microarchitecture, December 1997.

70
K. Kissell.
MIPS16: High-density MIPS for the Embedded Market.
Silicon Graphics MIPS Group, 1997.

71
Morten Kjelsø, Mark Gooch, and Simon Jones.
Design and performance of a main memory hardware data compressor.
In Proc. of EUROMICRO Conference. IEEE Computer Society Press, 1996.

72
Shmuel T. Klein.
Space- and time-efficient decoding with canonical Huffman trees.
In Alberto Apostolico and Jotun Hein, editors, Combinatorial Pattern Matching, 8th Annual Symposium, volume 1264 of Lecture Notes in Computer Science, pages 65-75, Aarhus, Denmark, 30 June-2 July 1997. Springer.

73
Philip Koopman Jr.
A preliminary exploration of optimized stack code generation.
In Proc. of Rochester Forth Conference, 1992.

74
L. N. Korolev.
Coding and code compression.
Journal of the ACM, 5(4):328-33, October 1958.

75
M. Kozuch and A. Wolfe.
Compression of embedded system programs.
In Proc. Int'l Conf. on Computer Design, 1994.

76
Michael Kozuch and Andrew Wolfe.
Performance analysis of the compressed code RISC processor.
Technical Report CE-A95-2, Princeton University Computer Engineering, 1995.

77
Werner Kreuzer and Bernhard Wess.
Cooperative register assignment and code compaction for digital signal processors with irregular datapath.
In Proc. Int'l Conf. on Acoustics, Speech and Signal Processing, 1997.

78
Arvind Krishnaswamy and Rajiv Gupta.
Profile guided selection of arm and thumb instructions.
In Proceedings of the joint conference on Languages, compilers and tools for embedded systems, pages 56-64. ACM Press, 2002.

79
Krishna Kunchithapadam and James R. Larus.
Using lightweight procedures to improve instruction cache performance.
Technical Report CS-TR-1999-1390, University of Wisconsin-Madison, 1999.

80
Young-Jun Kwon, Danny Parker, and Hyuk Jae Lee.
TOE: Instruction set architecture for code size reduction and two operations execution.
Presented at the International Workshop on Compiler and Architecture Support for Embedded Systems. Not published yet., October 1999.

81
S. Y. Larin and T. M. Conte.
Compiler-driven cached code compression schemes for embedded ILP processors.
In Proc. Int'l Symp. on Microarchitecture, November 1999.

82
Mario Latendresse.
The Code Compaction/Compression Bibliography.
http://www.iro.umontreal.ca.

83
Mario Latendresse.
Automatic generation of compact programs and virtual machines for scheme.
In Proc. of the Workshop on Scheme and Functional Programming, September 2000.

84
Mario Latendresse.
Génération de machines virtuelles pour l'exécution de programmes compressés.
PhD thesis, Université de Montréal, May 2000.
Available at www.iro.umontreal.ca/~latendre/publications/.

85
Mario Latendresse and Marc Feeley.
Fast and compact decoding of Huffman encoded virtual instructions.
Technical Report DIRO-1219, University of Montreal, November 2002.
Available at www.iro.umontreal.ca/~latendre/publications/.

86
Mario Latendresse and Marc Feeley.
Generation of fast interpreters for huffman compressed bytecode.
In Proc. of the Workshop on Interpreters, Virtual Machines, and Emulators. Association for Computing Machinery, June 2003.

87
Charles Lefurgy.
Efficient Execution of Compressed Programs.
PhD thesis, University of Michigan, June 2000.

88
Charles Lefurgy, Peter Bird, I-Cheng Chen, and Trevor Mudge.
Improving code density using compression techniques.
In Proc. Int'l Symp. on Microarchitecture, December 1997.

89
Charles Lefurgy and Trevor Mudge.
Code compression for DSP.
Technical Report CSE-TR-380-98, EECS Department, University of Michigan, November 1998.

90
Charles Lefurgy and Trevor Mudge.
Fast software-managed code decompression.
Presented at the International Workshop on Compiler and Architecture Support for Embedded Systems. Not published yet., July 1999.

91
Charles Lefurgy, Eva Piccininni, and Trevor Mudge.
Analysis of a high-performance code compression method.
In Proc. Int'l Symp. on Microarchitecture, November 1999.

92
Charles Lefurgy, Eva Piccininni, and Trevor Mudge.
Reducing code size with run-time decompression.
In Proc. of the International Symposium on High-Performance Computer Architecture, January 2000.

93
H. Lekatsas, J. Henkel, and W. Wolf.
Design and simulation of a pipelined decompression architecture for embedded systems.
In Proc. ACM/IEEE Int'l Symp. on System Synthesis, October 2001.
(To appear).

94
H. Lekatsas, Joerg Henkel, and Wayne Wolf.
Arithmetic coding for low power embedded system design.
In Proc. Data Compression Conference, pages 430-439, 2000.

95
H. Lekatsas, Joerg Henkel, and Wayne Wolf.
Code compression as a variable in hardware/software co-design.
In International Workshop on Hardware/Software Co-Design, 2000.

96
H. Lekatsas, Joerg Henkel, and Wayne Wolf.
Code compression for low power embedded system design.
In Proc. ACM/IEEE Design Automation Conference, 2000.

97
H. Lekatsas and Wayne Wolf.
SAMC: A code compression algorithm for embedded processors.
IEEE Transactions on CAD, 18(12):1689-1701, December 1999.

98
Haris Lekatsas, Jörg Henkel, and Venkata Jakkula.
Design of a one-cycle decompression hardware for performance increase in embedded systems.
In Proc. ACM/IEEE Design Automation Conference, pages 34-39, June 2002.

99
Haris Lekatsas and Wayne Wolf.
Code compression for embedded systems.
In Proc. ACM/IEEE Design Automation Conference, 1998.

100
Haris Lekatsas and Wayne Wolf.
Random access decompression using binary arithmetic coding.
In Proc. Data Compression Conference, pages 306-315, March 1999.

101
Xavier Leroy.
The ZINC experiment : an economical implementation of the ML language.
Technical Report RT-0117, Inria, Institut National de Recherche en Informatique et en Automatique, 1990.

102
Stan Liao.
Code Generation and Optimization for Embedded Digital Signal Processors.
PhD thesis, Massachusetts Institute of Technology, June 1996.

103
Stan Liao, S. Devadas, and K Keutzer.
Code density optimization for embedded DSP processors using data compression techniques.
In Proc. Conf. on Advanced Research in VLSI, 1995.

104
Stan Liao, Srinivas Devadas, Kurt Keutzer, and Steve Tjiang.
Instruction selection using binate covering for code size optimization.
In Proc. Int'l Conf. on Computer-Aided Design, pages 393-399, 1995.

105
Stan Liao, Srinivas Devadas, Kurt Keutzer, Steve Tjiang, and Albert Wang.
Code optimization techniques for embedded DSP microprocessors.
In Proc. ACM/IEEE Design Automation Conference, 1995.

106
Stan Liao, Srinivas Devadas, Kurt Keutzer, Steve Tjiang, and Albert Wang.
Storage assignment to decrease code size.
SIGPLAN Notices, 30(6):186-195, June 1995.

107
Stan Liao, Srinivas Devadas, Kurt Keutzer, Steven Tjiang, and Albert Wang.
Storage assignment to decrease code size.
ACM Transactions on Programming Languages and Systems, 18(3):235-253, May 1996.

108
Stan Liao, Kurt Keutzer, and Srinivas Devadas.
A text compression based method for code size minimization in embedded systems.
ACM Transactions on Design Automation of Electronic Systems, 4(1), January 1999.

109
Gábor Lóki, Ákos Kiss, Judit Jász, and Árpád Beszédes.
Code factoring in gcc.
In Proceedings of the 2004 GCC Developers' Summit, pages 79-84, June 2004.

110
Steven Lucco.
Split-stream dictionary program compression.
In Proc. Conf. on Programming Languages Design and Implementation, pages 27-34, Vancouver, British Columbia, June 18-21, 2000.

111
Steven Lucco.
Split-stream dictionary program compression.
In Proc. Conf. on Programming Languages Design and Implementation, pages 27-34, 2000.

112
Brian Marks.
Compilation to compact code.
IBM Journal of Research and Development, 24(6):684-691, November 1980.

113
Gert Markwardt, Günter Kemnitz, Rainer G. Spallek, and Patrick Schulz.
Efficient operand passing for RISC processors.
In Proc. of Workshop on Interaction between Compilers and Computer Architecture, San Jose, California, February 1996.

114
Henry Massalin.
Superoptimizer - a look at the smallest program.
In Proceedings of the Second International Conference on Architectural Support for Programming Languages and Operating Systems, pages 122-126, Palo Alto, California, 1987.

115
Edward M. McCreight.
A space-economical suffix tree construction algorithm.
Journal of the ACM, 23(2):262-272, April 1976.

116
W. M. McKeeman.
Peephole optimization.
Communications of the ACM, 8(7):443-444, July 1965.

117
Alex Miretsky, Arie Ben-Efraim, Vitaly Sukonik, Alexander Saper, Avi Ginsberg, Rami Natan, and Amit Dor.
RISC code compression model.
In Proc. Embedded Systems Conference, Chicago, Illinois, March 1999.

118
Alistair Moffat, Andrew Turpin, and Jyrki Katajainen.
Space-efficient construction of optimal prefix codes.
In Proc. Data Compression Conference, pages 192-201, March 1995.

119
T. P. Murtagh.
An improved storage management scheme for block structured languages.
ACM Transactions on Programming Languages and Systems, 13(3):327-398, July 1991.

120
Thomas P. Murtagh.
A less dynamic memory allocation scheme for algol-like languages.
In Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, pages 283-289, Salt Lake City, UT, January 1984.

121
Sang-Joon Nam, In-Cheol Park, and Chong-Min Kyung.
Improving dictionary-based code compression in VLIW architectures.
IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E82-A(11):2318-2324, November 1999.

122
Yakov Nekritch.
On efficient decoding of huffman codes.
Technical Report 85190-CS, Department of Computer Science, University of Bonn, May 1998.
Wed, 12 Nov 98 14:00:00 GMT.

123
Yakov Nekritch.
Decoding of canonical huffman codes with look-up tables.
Technical Report 85209-CS, University of Bonn, Department of Computer Science, January 2000.
Wed, 06 Sep 2000 09:44:01 GMT.

124
J.E.L. Peck, V.S. Manis, and W.E. Webb.
Code compaction for minicomputers with INTCODE and MINICODE.
Technical Report TR-75-02, Department of Computer Science, University of Britisch Columbia, 1975.

125
Thomas Pittman.
Two-level hybrid interpreter. native code execution for combined space-time program efficientcy.
In Proc. of the ACM SIGPLAN Symposium on Compiler Construction, pages 150-152, 1987.

126
Ian Piumarta and Fabio Riccardi.
Optimizing direct-threaded code by selective inlining.
ACM SIGPLAN Notices, 33(5):291-300, May 1998.

127
T. Proebsting.
Optimizing a ANSI C interpreter with superoperators.
In Proc. Symp. on Principles of Programming Languages, pages 322-332, 1995.

128
William Pugh.
Compressing Java class files.
In Proc. Conf. on Programming Languages Design and Implementation, pages 247-258, 1999.

129
Amit Rao and Santosh Pande.
Storage assignment optimizations to generate compact and efficient code on embedded DSPs.
In Proc. Conf. on Programming Languages Design and Implementation, May 1999.

130
Derek Rayside, Evan Mamas, and Erik Hons.
Compact java binaries for embedded systems.
In Cascon, pages 1-14, November 1999.

131
Donald L. Richards.
How to keep the addresses short.
Communications of the ACM, 14(5):346-349, May 1971.

132
Jonathan Rosenberg.
Generating Compact Code for Generic Subprograms.
PhD thesis, Carnegie Mellon University, 1983.

133
Cristina Ruggieri and Thomas P. Murtagh.
Lifetime analysis of dynamically allocated objects.
In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 285-293, San Diego, California, January 1988.

134
J. Runeson, S. Nyström, and J. Sjödin.
Optimizing code size through procedural abstraction.
In Proc. ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems, 2000.

135
Johan Runeson.
Code compression through procedural abstraction before register allocation.
Master's thesis, University of Uppsala, March 2000.
Note from author: In this version not all experimental results are correct; this will be corrected in a later version.

136
Eugene S. Schwartz and Bruce Kallick.
Generating a canonical prefix encoding.
Communications of the ACM, 7(3):166-169, March 1964.

137
G. S. Sohi and S. Vajapeyam.
Tradeoffs in instruction format design for horizontal architectures.
In Proceedings of the 3rd International Conference on Architectural Support for Programming Languages and Operating System (ASPLOS), volume 24, pages 15-25, New York, NY, May 1989. ACM Press.

138
A. Srivastava and A.M. Despain.
Prophetic branches: A branch architecture for code compaction and efficient execution.
In Proc. Int'l Symp. on Microarchitecture, pages 94-99, 1993.

139
Nobuhiko Sugino, Koji Tamura, and Akinori Nishihara.
DSP code optimization by use of code compression method based on neural network.
In Proc. Digital Signal Processing Symposium, pages 29-34, October 1993.

140
M. Taunton.
Compressed executables: An exercise in thinking small.
In Proc. of the Summer 1991 USENIX Conference, pages 385-403, Nashville, TN, 1991.

141
J.L. Turley.
Thumb squeezes ARM code size.
Microprocessor Report, 9(4), March 1995.

142
J.L. Turley.
M.core shrinks code, power budgets.
Microprocessor Report, pages 12-15, October 1997.

143
N. Turner.
The right to assemble. code compression with mini-interpreters.
Dr. Dobbs journal, pages 110-111, May 1986.

144
Henry S. Warren Jr.
Static main storage packing problems.
Acta Informatica, 9:355-376, 1978.

145
Maarten Wegdam.
Compact code through custom instruction sets.
Nat. Lab. Unclassified Report UR 822/98, Philips Research Laboratories, Eindhoven, The Netherlands, 1998.

146
P. Weiner.
Linear pattern matching algorithms.
In Conference Record, IEEE 14th Annual Symposium on Switching and Automata Theory, pages 1-11, 1973.

147
W. T. Wilner.
Burroughs B1700 memory utilization.
AFIPS FJCC, 41:579-586, 1972.

148
A. Wolfe and A. Chanin.
Executing compressed programs on an embedded RISC architecture.
In Proc. Int'l Symp. on Microarchitecture, 1992.

149
Y. Xie, H. Lekatsas, and W. Wolf.
Code compression for VLIW processors.
In Proc. Data Compression Conference, March 2001.

150
Y. Xie, H. Lekatsas, and W. Wolf.
A code decompression architecture for VLIW processors.
In Proc. Int'l Symp. on Microarchitecture, December 2001.
(Submitted).

151
Y. Xie, H. Lekatsas, and W. Wolf.
Compression ratio and decompression overhead tradeoffs in code compression for VLIW architectures.
In Proc. Int'l. Conference on ASIC, October 2001.
(Submitted).

152
Yukihiro Yoshida, Boa-Yu Song, Hiroyuki Okuhata, Takao Onoye, and Isao Shirakawa.
An object compression approach to embedded processors.
In Proc. Int'l. Symp. on Low-Power Electronics and Design, August 1997.

153
M. Zastre.
Compacting object code via parameterized procedural abstraction.
Master's thesis, University of Victoria, 1995.



Mario Latendresse 2004-11-15