A Space-Aware Bytecode Verifier for Java Cards

Authors:
Cinzia Bernardeschi;Giuseppe Lettieri;Luca Martini;Paolo Masci
Affiliations:
Dipartimento di Ingegneria dell'Informazione, Università di Pisa, Pisa, Italy;Dipartimento di Ingegneria dell'Informazione, Università di Pisa, Pisa, Italy;Dipartimento di Ingegneria dell'Informazione, Università di Pisa, Pisa, Italy;Dipartimento di Ingegneria dell'Informazione, Università di Pisa, Pisa, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 7
Cited 0

The program structure tree: computing control regions in linear time

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Java Card Technology for Smart Cards: Architecture and Programmer's Guide

Java Card Technology for Smart Cards: Architecture and Programmer's Guide
Java Virtual Machine Specification

Java Virtual Machine Specification
Bytecode verification on Java smart cards

Software—Practice & Experience
Java Bytecode Verification: Algorithms and Formalizations

Journal of Automated Reasoning
Building an "impossible" verifier on a java card

WIESS'02 Proceedings of the 2nd conference on Industrial Experiences with Systems Software - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

The bytecode verification is a key point of the security chain of the Java Platform. This feature is optional in many embedded devices since the memory requirements of the verification process are too high. In this paper we propose a verification algorithm that remarkably reduces the use of the memory by performing the verification during multiple specialized passes. The algorithm reduces the type encoding space by operating on different abstractions of the domain of types. The results of the experiments show that this bytecode verification can be performed directly on small memory systems.