Java bytecode verification via static single assignment form

Authors:
Andreas Gal;Christian W. Probst;Michael Franz
Affiliations:
University of California, Irvine;Technical University of Denmark, Kongens Lyngby;University of California, Irvine
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
2008

Citing 8
Cited 2

A type system for Java bytecode subroutines

ACM Transactions on Programming Languages and Systems (TOPLAS)
A formal framework for the Java bytecode language and verifier

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Marmot: an optimizing compiler for Java

Software—Practice & Experience
SafeTSA: a type safe and referentially secure mobile-code representation based on static single assignment form

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Java Virtual Machine Specification

Java Virtual Machine Specification
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom

Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Java Bytecode Verification: Algorithms and Formalizations

Journal of Automated Reasoning
A Type System for the Java Bytecode Language and Verifier

Journal of Automated Reasoning

Using abstract interpretation to add type checking for interfaces in Java bytecode verification

Theoretical Computer Science
Using abstract interpretation to add type checking for interfaces in Java bytecode verification

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Java Virtual Machines (JVMs) traditionally perform bytecode verification by way of an iterative dataflow 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.