2001•Concurrency and Computation Practice and ExperienceRequires access

Verified lightweight bytecode verification

Gerwin Klein, Tobias Nipkow

Abstract

Abstract Eva and Kristoffer Rose proposed a (sparse) annotation of Java Virtual Machine code with types to enable a one‐pass verification of well‐typedness. We have formalized a variant of their proposal in the theorem prover Isabelle/HOL and proved soundness and completeness. Copyright © 2001 John Wiley & Sons, Ltd.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 36 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Soundness, Bytecode, HOL, Programming language, Computer science, Completeness (order theory), Java, Automated theorem proving