Verified Bytecode Verifiers

  • Authors:
  • Tobias Nipkow

  • Affiliations:
  • -

  • Venue:
  • FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Using the theorem prover Isabelle/HOL we have formalized and proved correct an executable bytecode verifier in the style of Kildall's algorithm for a significant subset of the Java Virtual Machine. First an abstract framework for proving correctness of data flow based type inference algorithms for assembly languages is formalized. It is shown that under certain conditions Kildall's algorithm yields a correct bytecode verifier. Then the framework is instantiated with a model of the JVM.