Completeness of a bytecode verifier and a certifying Java-to-JVM compiler - CORE CORE Services Services overviewExplore all CORE services Access to raw data API Dataset FastSync Content discovery Recommender Discovery Managing content Repository dashboard Packages Repository edition About About us Our mission Team Blog FAQs Contact us Completeness of a bytecode verifier and a certifying Java-to-JVM compiler Authors Robert F. Stärk Joachim Schmid Publication date 2003 Publisher 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 text Java bytecode verification certifying compilation Similar works Full text CiteSeerXProvided a free PDF (195.62 KB) 10.1.1.19.7877oai:CiteSeerX.psu:10.1.1.19.7877 Last time updated on October 22, 2014View original full text link This paper was published in CiteSeerX. Having an issue? Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request. Report Useful links Blog About CORE Contacts Cookies Privacy notice Accessibility Writing about CORE? Discover our research outputs and cite our work. CORE is a not-for-profit service delivered by The Open University and Jisc.
