Grammar-based compression of interpreted code

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Grammar-based compression of interpreted code

Full text

Html (29 KB), Pdf

Pdf (114 KB)

Source

Communications of the ACM archive
Volume 46 , Issue 8 (August 2003) table of contents
Program compaction

SPECIAL ISSUE: Software techniques for program compaction table of contents

Pages: 61 - 66

Year of Publication: 2003

ISSN:0001-0782

Authors

William S. Evans	University of British Columbia
Christopher W. Fraser	Microsoft Research

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 43, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/859670.859699 What is a DOI?

ABSTRACT

Automatically designing and implementing compact interpretable bytecodes.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Cameron, R.D. Source encoding using syntactic information models. IEEE Transactions on Information Theory 34, 4 (1988), 843--850.
	2	Y. Choueka , S. T. Klein , Y. Perl, Efficient variants of Huffman codes in high level languages, Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval, p.122-130, June 05-07, 1985, Montreal, Quebec, Canada [doi>10.1145/253495.342777]
	3	Lars Ræder Clausen , Ulrik Pagh Schultz , Charles Consel , Gilles Muller, Java bytecode compression for low-end embedded systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.3, p.471-489, May 2000 [doi>10.1145/353926.353933]
	4	Jens Ernst , William Evans , Christopher W. Fraser , Todd A. Proebsting , Steven Lucco, Code compression, Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, p.358-365, June 16-18, 1997, Las Vegas, Nevada, United States [doi>10.1145/258915.258947]
	5	William S. Evans , Christopher W. Fraser, Bytecode compression via profiled grammar rewriting, Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, p.148-155, June 2001, Snowbird, Utah, United States [doi>10.1145/378795.378827]
	6	Jan Hoogerbrugge , Lex Augusteijn , Jeroen Trum , Rik Van De Wiel, A code compression system based on pipelined interpreters, Software—Practice & Experience, v.29 n.11, p.1005-2023, Sept. 1999 [doi>10.1002/(SICI)1097-024X(199909)29:11<1005::AID-SPE270>3.0.CO;2-F]
	7	Latendresse, M. Automatic generation of compact programs and virtual machines for Scheme. In Proceedings of the Workshop on Scheme and Functional Programming 2000, 45--52.
	8	Stan Liao , Srinivas Devadas , Kurt Keutzer, A text-compression-based method for code size minimization in embedded systems, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.4 n.1, p.12-38, Jan. 1999 [doi>10.1145/298865.298867]
	9	Todd A. Proebsting, Optimizing an ANSI C interpreter with superoperators, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.322-332, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199526]
	10	Stone, R.G. On the choice of grammar and parser for the compact analytical encoding of programs. Computer Journal 29, 4 (1986), 307--314.
	11	Thompson, R.A. and Booth, T.L. Encoding of probabilistic context-free languages. In Z. Kohavi and A. Paz, Eds, Theory of Machines and Computations. Academic Press, 1971.
	12	Tunstall, B.P. Synthesis of Noiseless Compression Codes. Ph.D. dissertation, Georgia Institute of Technology, 1967.