Java bytecode verification via static single assignment form

Andreas Gal, Christian W. Probst, Michael Franz

    Research output: Contribution to journalJournal articleResearchpeer-review


    Java Virtual Machines (JVMs) traditionally perform bytecode verification by way of an iterative data-flow analysis. Bytecode verification is necessary to ensure type safety because temporary variables in the JVM are not statically typed. We present an alternative verification mechanism that transforms JVM bytecode into Static Single Assignment Form (SSA) and thereby propagates definitions directly to uses. Type checking at control flow merge points can then be performed in a single pass. Our prototype implementation of the new algorithm is faster than the standard JVM bytecode verifier. It has the additional benefit of generating SSA as a side effect, which may be immediately useful for a subsequent dynamic compilation stage.
    Original languageEnglish
    JournalACM Transactions on Programming Languages and Systems
    Issue number4
    Pages (from-to)1-21
    Publication statusPublished - 2008


    Dive into the research topics of 'Java bytecode verification via static single assignment form'. Together they form a unique fingerprint.

    Cite this