This thesis presents Dava, a Java bytecode to Java source code decompiler built on top of the Soot framework., The Java Virtual Machine Specification of valid bytecode is much less restrictive than the Java Language Specification of valid Java source…

Java decompilers convert Java class files to Java source. Common Java decompilers are javac-specific decompilers since they target bytecode produced from a particular javac compiler. We present work carried out on Dava, a tool-independent decompiler that decompiles bytecode produced from…

Many compiler analyses and optimizations require precise information about the behaviour of pointers in order to be effective. Points-to analysis is a technique for computing this information that has been studied extensively over the last decade. Most of this research…

It is a common practice to retrieve code from an outside source, execute it and return the result to the user. During execution secure data can enter the program by user input or access of a data resource. It is…

Effective dynamic virtual-machine optimization depends on quickly finding and optimizing frequently-executed code regions. Such regions are naturally represented with a trace-cache, a collection of long, frequently-executed sequences of instructions. An ideal trace-cache is small and captures the majority of the…

Programs written for machine execution will always be susceptible to information theft. This information can include trademarked algorithms, data embedded in the program, or even data the program accesses. As technology advances computer scientists are building more and more powerful…

For many years, programmers have faced the problem of reading and trying to understand other programmers' code, either to maintain it or to learn from it. Analysis of dynamic data structure usage is useful for both program understanding and for…

Stock option trading has been very active since options were invented. Option analysis is very useful in helping investors decide investing strategies and predict the trend of the future stock movements. In this thesis, basic theory about stock option trading…

This thesis presents a new algorithm to compute the probability that a state in a labeled Markov chain model satisfies an LTL specification. A solution to this problem was given by Courcoubetis & Yannakakis in 1995, but unlike their solution…

The pure methods in a program are those that exhibit functional or side effect free behaviour, a useful property of methods or code in the context of program optimization as well as program understanding. However, gathering purity data is not…