A programming logic for Java bytecode programs

Quigley, Claire Louise (2004) A programming logic for Java bytecode programs. PhD thesis, University of Glasgow.

Full text available as:
[thumbnail of 2004QuigleyPhD.pdf] PDF
Download (5MB)
Printed Thesis Information: https://eleanor.lib.gla.ac.uk/record=b2188100


One significant disadvantage of interpreted bytecode languages, such as Java, is their low execution speed in comparison to compiled languages like C. The mobile nature of bytecode adds to the problem, as many checks are necessary to ensure that downloaded code from untrusted sources is rendered as safe as possible. But there do exist ways of speeding up such systems.

One approach is to carry out static type checking at load time, as in the case of the Java Bytecode Verifier. This reduces the number of runtime checks that must be done and also allows certain instructions to be replaced by faster versions. Another approach is the use of a Just In Time (JIT) Compiler, which takes the bytecode and produces corresponding native code at runtime. Some JIT compilers also carry out some code optimization.

There are, however, limits to the amount of optimization that can safely be done by the Verifier and JITs; some operations simply cannot be carried out safely without a certain amount of runtime checking. But what if it were possible to prove that the conditions the runtime checks guard against would never arise in a particular piece of code? In this case it might well be possible to dispense with these checks altogether, allowing optimizations not feasible at present. In addition to this, because of time constraints, current JIT compilers tend to produce acceptable code as quickly as possible, rather than producing the best code possible. By removing the burden of analysis from them it may be possible to change this.

We demonstrate that it is possible to define a programming logic for bytecode programs that allows the proof of bytecode programs containing loops. The instructions available to use in the programs are currently limited, but the basis is in place to extend these. The development of this logic is non-trivial and addresses several difficult problems engendered by the unstructured nature of bytecode programs.

Item Type: Thesis (PhD)
Qualification Level: Doctoral
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Colleges/Schools: College of Science and Engineering > School of Computing Science
Supervisor's Name: Gay, Dr. Simon and Melham, Dr. Tom
Date of Award: 2004
Depositing User: Mr Toby Hanning
Unique ID: glathesis:2004-3030
Copyright: Copyright of this thesis is held by the author.
Date Deposited: 24 Nov 2011
Last Modified: 10 Dec 2012 14:03
URI: https://theses.gla.ac.uk/id/eprint/3030

Actions (login required)

View Item View Item


Downloads per month over past year