Combining global code and data compaction

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 8, 2001, Pages 29-38

  De Sutter, Bjorn ^a   De Bus, Bruno ^a   De Bosschere, Koen ^a   Debray, Saumya ^b  

^a GHENT UNIVERSITY   (Belgium)

^b UNIVERSITY OF ARIZONA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17244378620     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/384196.384204     Document Type: Article

References (24)

1. O. Agesen and D. Ungar. Sifting out the gold: Delivering compact applications from an exploratory object-oriented environment. In Proc. OOPSLA, pages 355-370, Oct. 1994.
2. A. Aho, R. Sethi, and J. Ullman. Compilers, Principles, Techniques and Tools. Addison-Wesley, 1986.
3. B. S. Baker and U. Manber. Deducing similarities in Java sources from bytecodes. In Proc. USENIX Annual Technical Conference, pages 179-190, Berkeley, CA, June 1998. Usenix.
4. L. Clausen, U. Schultz, C. Consel, and G. Muller. Java bytecode compression for low-end embedded systems. ACM TOPLAS, 22(3):471-489, May 2000.
5. C. Click and K. Cooper. Combining analyses, combining optimizations. ACM TOPLAS, 17(2):181-196, March 1995.
6. K. Cooper and N. McIntosh. Enhanced code compression for embedded RISC processors. In Proc. PLDI, pages 139-149, May 1999.
7. B. De Sutter, B. De Bus, S. Debray, and K. De Bosschere. Combining global code and data compaction. Technical Report PARIS 01-02, Ghent University, 2001.
8. S. Debray, W. Evans, R. Muth, and B. De Sutter. Compiler techniques for code compaction. ACM TOPLAS, 22(2):378-415, March 2000.
9. S. Debray, R. Muth, and M. Weippert. Alias analysis of executable code. In Proc. 1998 ACM Symposium on Principles of Programming Languages (POPL-98), pages 12-24, January 1998.
10. J. Ernst, W. Evans, C. Fraser, S. Lucco, and T. Proebsting. Code compression. In Proc. PLDI, pages 358-365, June 1997.
11. M. Franz. Adaptive compression of syntax trees and iterative dynamic code optimization: Two basic technologies for mobile-object systems. In J. Vitek and C. Tschudin, editors, Mobile Object Systems: Towards the Programmable Internet, number 1222 in LNCS, pages 263-276. Springer, Feb. 1997.
12. M. Franz and T. Kistler. Slim binaries. Commun. ACM, 40(12):87-94, Dec. 1997.
13. C. Fraser. Automatic inference of models for statistical code compression. In Proc. PLDI, pages 242-246, May 1999.
14. C. Fraser, E. Myers, and A. Wendt. Analyzing and compressing assembly code. In Proc. ACM SIGPLAN Symposium on Compiler Construction, volume 19, pages 117-121, June 1984.
15. N. Jones, C. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall International, 1993.
16. T. M. Kemp, R. M. Montoye, J. D. Harper, J. D. Palmer, and D. J. Auerbach. A decompression core for PowerPC. IBM J. Research and Development, 42(6), November 1998.
17. K. D. Kissell. MIPS16: High-density MIPS for the embedded market. In Proc. Real Time Systems '97 (RTS97), 1997.
18. R. Muth, S. Debray, S. Watterson, and K. De Bosschere. alto : A link-time optimizer for the Compaq Alpha. Software Practice and Experience, 31(1):67-101, January 2001.
19. W. Pugh. Compressing Java class files. In Proc. PLDI, pages 247-258, May 1999.
20. A. Srivastava. Unreachable procedures in object-oriented programming. ACM Letters on Programming Languages and Systems, 1(4):355-364, December 1992.
21. A. Srivastava and W. Wall. Link-time optimization of address calculation on a 64-bit architecture. In Proc. PLDI, pages 49-60, June 1994.
22. P. Sweeney. and F. Tip. A study of dead data members in C++ applications. In Proc. PLDI, pages 324-323, June 1998.
23. F. Tip, C. Laffra, and P. Sweeney. Practical experience with an application extractor for Java. In Proc. OOPSLA, pages 292-305, Nov. 1999.
24. M. Wegman and F. Zadeck. Constant propagation with conditional branches. ACM TOPLAS, 13(2):181-210, April 1991.