article · 2008
Compressed Abstract Syntax Trees for Mobile Code
Cited by 5Abstract and details only
Abstract
Abstract syntax trees (ASTs) have numerous advantages as a mobile code format over the more commonly used bytecode-based formats. Not only are ASTs portable, inherently safer, and more suitable for optimization, but we show that they also compress more densely. We have developed a prototype framework for AST compression, which we have used to compress Java programs. Our generic implementation reduces the size of regular Java archives by a factor of 3 to 8 and improves on the best published Java-specific compression scheme by 5–50%.
Cite this paper
(2008). Compressed Abstract Syntax Trees for Mobile Code.
“Compressed Abstract Syntax Trees for Mobile Code.” 2008.
2008. “Compressed Abstract Syntax Trees for Mobile Code.”
(2008) ‘Compressed Abstract Syntax Trees for Mobile Code’.
@article{anon2008compressed,
title = {{Compressed Abstract Syntax Trees for Mobile Code}},
year = {2008}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Compressing Metaclass Files Through String Optimization
S. Nadera Beevi · Algorithms for intelligent systems · 2020
Cited by 0
Generation of fast interpreters for Huffman compressed bytecode
Mario Latendresse, Marc Feeley · 2003
Cited by 14
A structured-based differencing method for version control system for java codes
Samir Elmougy, Waleed Eladrosy · IEEE International Symposium on Signal Processing and Information Technology (ISSPIT) · 2010
Cited by 1
Data structures and software development in Java
David D. Riley · 2003
Cited by 0