Java bytecode verification: algorithms and formalizations - Archive ouverte HAL Access content directly
Journal Articles Journal of Automated Reasoning Year : 2003

Java bytecode verification: algorithms and formalizations

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.
Fichier principal
Vignette du fichier
bytecode-verification-JAR.pdf (271.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01499939 , version 1 (01-04-2017)

Identifiers

Cite

Xavier Leroy. Java bytecode verification: algorithms and formalizations. Journal of Automated Reasoning, 2003, 30 (3-4), pp.235--269. ⟨10.1023/A:1025055424017⟩. ⟨hal-01499939⟩

Collections

INRIA INRIA2
118 View
1394 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More