Completeness of a bytecode verifier and a certifying Java-to-JVM compiler (2003)
| Citations: | 5 - 0 self |
BibTeX
@MISC{Stärk03completenessof,
author = {Robert F. Stärk and Joachim Schmid},
title = {Completeness of a bytecode verifier and a certifying Java-to-JVM compiler},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
During an attempt to prove that the Java-to-JVM compiler generates code that is accepted by the Bytecode Verifier we found examples of legal Java programs that are rejected by the verifier. We propose therefore to restrict the socalled rules of definite assignment for the try-finally statement as well as for the labeled statement such that the example programs are no longer allowed. Then we can prove, using the framework of Abstract State Machines, that each program from the slightly restricted Java language is accepted by the Bytecode Verifier. In the proof we use a new notion of bytecode type assignment without subroutine call stacks.
