Verified bytecode verifiers

✍ Scribed by Gerwin Klein; Tobias Nipkow

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 335 KB
• Volume: 298
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(02)00869-1

✦ Synopsis

Using the theorem prover Isabelle/HOL we have formalized and proved correct and executable bytecode veriÿer in the style of Kildall's algorithm for a signiÿcant subset of the Java Virtual Machine (JVM). First an abstract framework for proving correctness of data ow based type inference algorithms for assembly languages is formalized. It is shown that under certain conditions Kildall's algorithm yields a correct bytecode veriÿer. Then the framework is instantiated with our previous work about the JVM. Finally, we demonstrate the exibility of the framework by extending our previous JVM model and the executable bytecode veriÿer with object initialization.