Completeness of a Bytecode Verifier and a Certifying Java-to-JVM Compiler

Authors:
Robert F. Stärk;Joachim Schmid
Affiliations:
ETH Zürich. e-mail: staerk@inf.ethz.ch;Siemens AG, Munich. e-mail: joachim.schmid@tydo.de
Venue:
Journal of Automated Reasoning
Year:
2003

Citing 10
Cited 3

Evolving algebras 1993: Lipari guide

Specification and validation methods
A simple, comprehensive type system for Java bytecode subroutines

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for Java bytecode subroutines

ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system for object initialization in the Java bytecode language

ACM Transactions on Programming Languages and Systems (TOPLAS)
A certifying compiler for Java

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Standard fixpoint iteration for Java bytecode verification

ACM Transactions on Programming Languages and Systems (TOPLAS)
Java Virtual Machine Specification

Java Virtual Machine Specification
Java Language Specification, Second Edition: The Java Series

Java Language Specification, Second Edition: The Java Series
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom

Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
On-Card Bytecode Verification for Java Card

E-SMART '01 Proceedings of the International Conference on Research in Smart Cards: Smart Card Programming and Security

Java Bytecode Verification: Algorithms and Formalizations

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

Journal of Automated Reasoning
Towards proving type safety of .NET CIL

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

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 rules of definite assignment for the try-finally statement as well as for the labeled statement so 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.