Modelling a JVM for polymorphic bytecode

By: Giovanni Lagorio


The paper analyzes how polymorphic bytecode can be dynamically linked by presenting a deterministic model of a Java Virtual Machine which interleaves loading and linking steps with execution. In this model, loading and execution phases are basically standard, whereas verification handles also type constraints, which are part of polymorphic bytecode, and resolution blends in verification.

Cite as:

Giovanni Lagorio, “Modelling a JVM for polymorphic bytecode”, Journal of Object Technology, Volume 6, no. 5 (June 2007), pp. 71-100, doi:10.5381/jot.2007.6.5.a2.

PDF | HTML | DOI | BiBTeX | Tweet this | Post to CiteULike | Share on LinkedIn

The JOT Journal   |   ISSN 1660-1769   |   DOI 10.5381/jot   |   AITO   |   Open Access   |    Contact