Search

Your search keyword '"SafeTSA"' showing total 3 results
Start Over Descriptor "SafeTSA"
3 results on '"SafeTSA"'

1. Safe bounds check annotations.

Author

von Ronne, Jeffery, Gampe, Andreas, Niedzielski, David, and Psarris, Kleanthis

Subjects
JAVA programming language, COMPILERS (Computer programs), SEMANTICS, PROGRAMMING languages, COMPUTER software, ANNOTATIONS
Abstract

The semantics of the Java programming language require that the out-of-bounds array accesses be caught at runtime. In general, this requires dynamic checks at the time the array element is accessed. Some of these checks can be eliminated statically during just-in-time (JIT) compilation, but the most precise analyses are too expensive to run in JIT compilers. This paper presents a framework in which thorough static range analyses can be used safely during the less-performance-critical compilation of Java source into machine-independent mobile code. In this framework, the static analysis results are used to derive proofs that certain linear inequality constraints hold. These linear constraints and their proofs are then added to the mobile code as annotations. The annotation framework is designed so that proofs can be verified efficiently. This allows the JIT compiler to safely eliminate array bounds checks during compilation without an expensive runtime analysis. Experiments with a prototype system that can generate and verify these annotations demonstrate that this framework is more precise than prior work and that verification is efficient. Copyright © 2008 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Published
2009
Full Text
View/download PDF

2. Quantifying the Benefits of SSA-Based Mobile Code.

Author

Amme, Wolfram, von Ronne, Jeffery, and Franz, Michael

Subjects
JAVA programming language, CODE generators, CODING theory, GENERATORS (Computer programs)
Abstract

Abstract: High-performance just-in-time compilers for Java need to invest considerable effort before actual code generation can commence. This is in part due to the very nature of the Java Virtual Machine, which is not well matched to the requirements of optimizing code generators. Alternative transportation formats based on Static Single Assignment form should theoretically be superior to virtual machines, but this claim has not previously been validated in practice. This paper revisits the topic and attempts to quantify the effect of using an SSA-based mobile code representation (IR) instead of a virtual-machine based one. To this end, we have integrated full support for a verifiable SSA-based IR into Jikes RVM, an existing Java execution environment. The resulting system is capable of loading and executing Java programs represented in either format, traditional JVM bytecode as well as the SSA-based representation, and it can even execute programs made up of a mixture of the two formats. In our implementation, the two alternative just-in-time compilation pipelines share a common low-level code generator. Performance results are encouraging and show simultaneous improvements in both compilation time and code quality relative to Jikes RVM''s standard optimizing compiler for JVM class files. They support the hypothesis that SSA-based intermediate representations offer advantages in the context of just-in-time compilation. [Copyright &y& Elsevier]

Published
2005
Full Text
View/download PDF

3. Quantifying the Benefits of SSA-Based Mobile Code

Author

Wolfram Amme, Michael Franz, and Jeffery von Ronne

Subjects
Tracing just-in-time compilation, Source code, General Computer Science, Dead code, Java, Computer science, media_common.quotation_subject, Optimizing compiler, 0102 computer and information sciences, 02 engineering and technology, Dynamic compilation, computer.software_genre, 01 natural sciences, Dead code elimination, Theoretical Computer Science, Compilation error, 0202 electrical engineering, electronic engineering, information engineering, Code generation, media_common, computer.programming_language, Mobile code, Programming language, SafeTSA, strictfp, 020207 software engineering, Java concurrency, Software quality, Bytecode, Threaded code, Just-in-time compilation, 010201 computation theory & mathematics, Virtual machine, single static assignment form, virtual machine, Unreachable code, Compiler, Software_PROGRAMMINGLANGUAGES, Java annotation, computer, Computer Science(all), Java Modeling Language
Abstract

High-performance just-in-time compilers for Java need to invest considerable effort before actual code generation can commence. This is in part due to the very nature of the Java Virtual Machine, which is not well matched to the requirements of optimizing code generators. Alternative transportation formats based on Static Single Assignment form should theoretically be superior to virtual machines, but this claim has not previously been validated in practice. This paper revisits the topic and attempts to quantify the effect of using an SSA-based mobile code representation (IR) instead of a virtual-machine based one.To this end, we have integrated full support for a verifiable SSA-based IR into Jikes RVM, an existing Java execution environment. The resulting system is capable of loading and executing Java programs represented in either format, traditional JVM bytecode as well as the SSA-based representation, and it can even execute programs made up of a mixture of the two formats. In our implementation, the two alternative just-in-time compilation pipelines share a common low-level code generator.Performance results are encouraging and show simultaneous improvements in both compilation time and code quality relative to Jikes RVM's standard optimizing compiler for JVM class files. They support the hypothesis that SSA-based intermediate representations offer advantages in the context of just-in-time compilation.

Published
2005
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results