Using Control Dependencies for Space-Aware Bytecode Verification

Authors:
C. Bernardeschi;G. Lettieri;L. Martini;P. Masci
Affiliations:
Dipartimento di Ingegneria dell'Informazione, Università di Pisa, Via Diotisalvi 2, Pisa 56100, Italy;Corresponding author: g.lettieri@iet.unipi.it;Dipartimento di Ingegneria dell'Informazione, Università di Pisa, Via Diotisalvi 2, Pisa 56100, Italy;Dipartimento di Ingegneria dell'Informazione, Università di Pisa, Via Diotisalvi 2, Pisa 56100, Italy
Venue:
The Computer Journal
Year:
2006

Citing 0
Cited 4

Instruction-level security analysis for information flow in stack-based assembly languages

Information and Computation
Decomposing bytecode verification by abstract interpretation

ACM Transactions on Programming Languages and Systems (TOPLAS)
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 applets run on a Virtual Machine that checks code integrity and correctness before execution using a module called the Bytecode Verifier. Java Card technology allows Java applets to run on smart cards. The large memory requirements of the verification process do not allow the implementation of an embedded Bytecode Verifier in the Java Card Virtual Machine. To address this problem, we propose a verification algorithm that optimizes the use of system memory by imposing an ordering on the verification of the instructions. This algorithm is based on control flow dependencies and immediate postdominators in control flow graphs.