Tobias Nipkow. Towards verified bytecode verifiers. Submitted for publication, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Resource Control of Untrusted Code in an Open Network Environment - Menage (2003) (2 citations) (Correct)
....was not undertaken due to time constraints. 6.2. 7 Lack of bytecode verifier In order to guarantee that a loaded Caml bytecode module actually respects the definition of the Caml language (and hence may be safely executed without need for hardware protection) it is necessary to use a verifier [Nipkow99] The verifier checks the execution structure of the functions within the module, and ensures that the code does not perform illegal operations such as: Dereferencing an integer. Accessing the contents of an abstract data object. Branching to an invalid instruction. Accessing ....
....Java from creating similar type system violations. Verification: The bytecode in the module must be shown to conform to the interfaces which it imports exports, and to respect any typing constraints associated with the language in which it is written, using techniques such as those presented in [Nipkow99] Appendix A presents a design outline for a verifier for Objective Caml bytecode. Resolution: The imports of a module must be fixed up so that they point to the corresponding exports in the modules that are being imported. 6.7 Service Implementation This section presents some of the key ....
Tobias Nipkow. Towards Verified Bytecode Verifiers. http: //www4.informatik.tu-muenchen.de/~nipkow/pubs/bcv.ps.gz, 1999.
μJava: Embedding a Programming Language in a Theorem.. - Nipkow, von Oheimb, Pusch (2000) Self-citation (Nipkow) (Correct)
No context found.
Tobias Nipkow. Towards verified bytecode verifiers. Submitted for publication, 1999.
μJava: Embedding a Programming Language in a Theorem.. - Nipkow, von Oheimb, Pusch (2000) Self-citation (Nipkow) (Correct)
....considerably larger subset of the JVM. Closely related is the work by Stata and Abadi [SA98] who treat subroutines, and the work by Freund and Mitchell [FM98] who treat object initialization. The correctness of the data flow analyzer is analyzed by Goldberg [Gol98] and, more abstractly, Nipkow [Nip99b] An unorthodox approach to bytecode verification via model checking is reported by Basin et al. BFPV99] 6.2.2 Types and type relations The static types for the JVM are the same as for Java, i.e. of type ty. Thus we can reuse a number of concepts from the Java level. The main distinction is ....
Tobias Nipkow. Towards verified bytecode verifiers. Submitted for publication, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC