Verified lightweight bytecode verification
Authors:
- 13 November 2001
- journal article
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 13 (13) , 1133-1151
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.Keywords
This publication has 10 references indexed in Scilit:
- A formal framework for the Java bytecode language and verifier1999
- Isar — A Generic Interpretative Approach to Readable Formal Proof Documents1999
- Proving the Soundness of a Java Bytecode Verifier Specification in Isabelle/HOL1999
- A Formal Specification of Javaℳ Virtual Machine Instructions for Objects, Methods and Subroutines1999
- A type system for object initialization in the Java bytecode language1998
- From system F to typed assembly language1998
- A type system for Java bytecode subroutines1998
- On a New Method for Dataflow Analysis of Java Virtual Machine Subroutines1998
- Byte code verification for Java smart cards based on model checking1998
- Isabelle1994