Treffer: Verified bytecode subroutines
Title:
Verified bytecode subroutines
Authors:
Source:
TPHOLs 2003 : theorem proving in higher order logics (Rome, 8-12 September 2003)Lecture notes in computer science. :55-70
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 19 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Logiciel, Software, Généralités, General, Analyse flux donnée, Data flow analysis, Démonstration théorème, Theorem proving, Demostración teorema, Langage JAVA, JAVA language, Lenguaje JAVA, Machine virtuelle, Virtual machine, Máquina virtual, Programmation logique, Logical programming, Programación lógica, Sous programme, Subroutine, Subprograma, Spécification, Specification, Especificación, Théorie preuve, Proof theory, Teoría demonstración
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Technische Universität München, Germany
ISSN:
0302-9743
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15691090
Database:
PASCAL Archive
Weitere Informationen
Subroutines are a major complication for Java bytecode verification: they are difficult to fit into the data flow analysis that the Java Virtual Machine (JVM) specification suggests. We examine the problems that occur with subroutines and give an overview of the most prominent solutions in the literature. Using the theorem prover Isabelle/HOL, we have extended our substantial formalization of the JVM and the bytecode verifier with its proof of correctness by the most general solution for bytecode subroutines.