Optimizing Java bytecodes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Java bytecodes

We have developed a research compiler for Java class files. The compiler, which we call Briki, is designed to test new compilation techniques. We focus on optimizations which are only possible or much easier to perform on a high-level intermediate representation. We have designed such a representation, JavaIR, and have written a front-end which recovers high-level structure from the information...

متن کامل

Compiling XQuery to Java bytecodes

Sequence is an abstract class, which is used for many purposes: nodes, sequences, Scheme lists and vectors. The NodeTree sub-class is used for nodes. It stores an entire document or document fragment in two arrays: a character array, and an Object array. “Pointers” between nodes are relative indexes stored in the character array using one or two 16-bit characters. The representation uses a “buf...

متن کامل

Deducing Similarities in Java Sources from Bytecodes

Several techniques for detecting similarities of Java programs from bytecode les, without access to the source, are introduced in this paper. These techniques can be used to compare two les, to nd similarities among thousands of les, or to compare one new le to an index of many old ones. Experimental results indicate that these techniques can be very e ective. Even changes of 30% to the source ...

متن کامل

An Evaluation of Specialized Java Bytecodes

Specialized Java bytecodes provide functionality that is easily replicated using other Java bytecodes. This study uses profiling to explore how the set of specialized bytecodes currently implemented by the Java Virtual Machine is utilized by comparing it to the other specialized bytecodes which could have been implemented.

متن کامل

A Verifier for Region-Annotated Java Bytecodes

This paper presents a verifier for the memory-safe execution of extended Java bytecodes that support region-based memory management and explicit deallocation primitives. The verifier reads in region-annotated bytecodes that augment the standard Java bytecodes with instructions for creating and removing memory regions, allocating objects in regions, and passing regions as parameters. The verific...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Concurrency: Practice and Experience

سال: 1997

ISSN: 1040-3108,1096-9128

DOI: 10.1002/(sici)1096-9128(199706)9:6<427::aid-cpe300>3.0.co;2-k