Java Bytecode Verification: Algorithms and Formalizations

  • Xavier Leroy
  • Published 2003 in Journal of Automated Reasoning

Abstract

Bytecode verification is a crucial security component for Java applets, on the Web and on embedded devices such as smart cards. This paper reviews the various bytecode verification algorithms that have been proposed, recasts them in a common framework of dataflow analysis, and surveys the use of proof assistants to specify bytecode verification and prove its correctness.

DOI: 10.1023/A:1025055424017

Extracted Key Phrases

5 Figures and Tables

Statistics

01020'04'06'08'10'12'14'16
Citations per Year

178 Citations

Semantic Scholar estimates that this publication has 178 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Leroy2003JavaBV, title={Java Bytecode Verification: Algorithms and Formalizations}, author={Xavier Leroy}, journal={Journal of Automated Reasoning}, year={2003}, volume={30}, pages={235-269} }