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. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Generation of Fast Interpreters for Huffman Compressed - Tecode Mario Latendresse Self-citation (Latendresse) (Correct)
No context found.
M. Latendresse. Automatic generation of compact programs and virtual machines for Scheme. In M. Felleisen, editor, Proceedings of the Workshop on Scheme and Functional Programming, Sept. 2000. Available at www.iro.umontreal.ca/~latendre/publications/.
Generation of Fast Interpreters for Huffman Compressed Bytecode - Latendresse, Feeley (2003) (2 citations) Self-citation (Latendresse) (Correct)
No context found.
M. Latendresse. Automatic generation of compact programs and virtual machines for Scheme. In M. Felleisen, editor, Proceedings of the Workshop on Scheme and Functional Programming, Sept. 2000. Available at www.iro.umontreal.ca/~latendre/publications/.
Fast and Compact Decoding of Huffman Encoded Virtual.. - Latendresse, Feeley Self-citation (Latendresse) (Correct)
....and interpreter are taken into account to reduce program sizes. This approach is transparent for the compiler writer since the compression of programs can be done from the same encoding as the sample. The detail techniques used to automatically generate the instruction set is partly presented in [15] and fully presented in [16] In this paper we focus on the ecient decoding of these virtual instructions and the automatic generation of decoders. This context allows two major applications of the work presented in this paper. The rst one is the conception of virtual machines, such as the KVM, ....
....has three bits and the longest opcodes have twelve bits. Forty of the existing instructions were duplicated but with shorter parameter elds resulting in a 241 instruction JVM machine. This extension was done automatically by our tool to generate virtual instruction sets from a sample of programs [15, 16]. The sole choices of macro instructions and parameter lengths were done to better compress the classes and not for speed. All class les for the BYTEmark benchmarks, including all libraries in classes.zip, are compressed based on the new Hu man opcodes, the new formats, and the macroinstructions. ....
[Article contains additional citation context not shown here]
Mario Latendresse. Automatic generation of compact programs and virtual machines for Scheme. In Matthias Felleisen, editor, Proceedings of the Workshop on Scheme and Functional Programming, Rice Technical Report 00-368, September 2000.
Unknown - Rograms That Must (Correct)
No context found.
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.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC