Simple verification technique for complex Java bytecode subroutines (2002)
Cached
Download Links
| Venue: | In Proc. 4th ECOOP Workshop on Formal Techniques for Java-like Programs |
| Citations: | 15 - 2 self |
BibTeX
@INPROCEEDINGS{Coglio02simpleverification,
author = {Alessandro Coglio},
title = {Simple verification technique for complex Java bytecode subroutines},
booktitle = {In Proc. 4th ECOOP Workshop on Formal Techniques for Java-like Programs},
year = {2002},
pages = {647--670}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Java is normally compiled to bytecode, which is verified and then executed by the Java Virtual Machine. Bytecode produced via compilation must pass verification. The main cause of complexity for bytecode verification is subroutines, used by compilers to generate more compact code. The techniques to verify subroutines proposed in the literature reject certain programs produced by mundane compilers or are otherwise difficult to realize within an implementation of the Java Virtual Machine. This paper presents a novel technique which is very simple to understand, implement, and prove sound. It is also very powerful: the set of accepted programs has a simple characterization which most likely includes all code generable by current compilers and which enables future compilers to make more extensive use of subroutines. 1 Java Bytecode Java [2, 11] is normally compiled to a platform-independent bytecode language, which is executed by the Java Virtual Machine (JVM) [18]. This bytecode language features intra-method subroutines, used by Java compilers to generate more compact code [18, Sect. 7.13].
