Skip Navigation



The Computer Journal Advance Access published online on January 23, 2006
The Computer Journal, doi:10.1093/comjnl/bxh161
This Article
Right arrow Full Text (Rapid PDF)
Right arrow All Versions of this Article:
49/2/234    most recent
bxh161v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bernardeschi, C.
Right arrow Articles by Masci, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
Received August 5, 2005
Revised December 6, 2005

Article

Using Control Dependencies for Space-Aware Bytecode Verification

C. Bernardeschi 1 *, G. Lettieri 1, L. Martini 1, and P. Masci 1

1 Dipartimento di Ingegneria dell'Informazione, Università di Pisa, Via Diotisalvi 2, Pisa 56100, Italy

* To whom correspondence should be addressed.
C. Bernardeschi, E-mail: g.lettieri{at}iet.unipi.it


  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.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.