Verified lightweight bytecode verification

Concurrency and Computation: Practice and Experience

Volumn 13, Issue 13, 2001, Pages 1133-1151

  Klein, Gerwin ^a   Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Bytecode verification; Data flow analysis; Java; Theorem proving

Indexed keywords

CRYPTOGRAPHY; DATA FLOW ANALYSIS; SEMANTICS; SMART CARDS; SUBROUTINES; THEOREM PROVING;

BYTECODES;

JAVA PROGRAMMING LANGUAGE;

EID: 0035506225     PISSN: 15320626     EISSN: None     Source Type: Journal    
DOI: 10.1002/cpe.597     Document Type: Article

References (26)

1. Lightweight bytecode verification
2. Proving the soundness of a Java bytecode verifier specification in Isabelle/HOL
3. μJava: Embedding a programming language in a theorem prover
4. Isabelle: A generic theorem prove
5. A type system for Java bytecode subroutines
6. A type system for object initialization in the Java bytecode language
7. A formal framework for the Java bytecode language and verifier
8. A formal specification of Java virtual machine instructions for objects, methods and subroutines
9. Standard fixpoint iteration for Java bytecode verification
10. On a new method for dataflow analysis of Java virtual machine subroutines
11. A simple, comprehensive type system for Java bytecode subroutines
12. The functions of Java bytecode
13. A compositional account of the Java virtual machine
14. Byte code verification for Java smart cards based on model checking
15. Verified bytecode verifiers
16. Proof-carrying code
17. From system F to typed assembly language
18. Isar - A generic interpretative approach to readable formal proof documents
19. Connected, limited device configuration
20. The costs and benefits of Java bytecode subroutines