JVM Bytecode Verification Without Dataflow Analysis

Authors:
Ian Bayley;Sam Shiel
Affiliations:
Department of Computing, Oxford Brookes University, Oxford OX33 1HX, U.K.;Department of Computing, Oxford Brookes University, Oxford OX33 1HX, U.K.
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 7
Cited 0

Eliminating go to's while preserving program structure

Journal of the ACM (JACM)
Algebra of programming

Algebra of programming
A type system for Java bytecode subroutines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Flow diagrams, turing machines and languages with only two formation rules

Communications of the ACM
Java Virtual Machine Specification

Java Virtual Machine Specification
Decompiling Java Bytecode: Problems, Traps and Pitfalls

CC '02 Proceedings of the 11th International Conference on Compiler Construction
Java Bytecode Verification: Algorithms and Formalizations

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bytecode verification algorithms are traditionally based on dataflow analysis. We present an alternative algorithm that first restructures the bytecode and then infers a type signature for each method in a manner typical of functional programming languages. We also give an operational semantics to an algebra of structured bytecode and thereby prove both that restructuring preserves semantics and that our type inference is sound.