Bytecode compression via profiled grammar rewriting

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2001, Pages 148-155

  Iwanczyk, J S ^a   Patt, B E ^a   Tull, C R ^a   MacDonald, L R ^a   Skinner, N ^a   Hoffman, E J ^b   Fornaro, L ^c   Mussio, L ^c   Saucedo, E ^c   Gancharov, A ^c  

^a Photon Imaging Inc   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Faculty of Chemistry   (Uruguay)

Author keywords

Bytecode interpretation; Context free grammars; Program compression; Variable to fixed length codes

Indexed keywords

CODE CONVERTERS; COMPUTATIONAL GRAMMARS; LOCAL AREA NETWORKS; MACHINE ORIENTED LANGUAGES; PROGRAM INTERPRETERS; REDUCED INSTRUCTION SET COMPUTING; ROM;

BYTECODED INSTRUCTION SETS;

DATA COMPRESSION;

EID: 0034819646     PISSN: None     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. Source encoding using syntactic information models
2. Efficient variants of Huffman codes in high level languages
3. Enhanced code compression for embedded RISC processors
4. Compiler techniques for code compaction
5. An efficient context-free parsing algorithm
6. A new compression scheme for syntactically structured messages (programs) and its application to Java and the internet
7. Code compression
8. Compression via guided parsing
9. Slim binaries
10. Automatic inference of models for statistical code compression
11. A code compression system based on pipelined interpreters
12. A method for the construction of minimum redundancy codes
13. Prediction by grammatical match
14. Reducing code size with run-time decompression
15. Split-stream dictionary program compression
16. Optimizing an ANSI C interpreter with superoperators
17. Text compression based on variable-to-fixed codes for Markov sources
18. The case for compressed caching in virtual memory systems