Virtual method calls are a fundamental feature offered by Java, an object-oriented programming language. However, they are also a source of degradation of performance at run time and imprecision in interprocedural analyses. There are several well known, inexpensive analyses that…

We present a new approach to eliminate array bounds checks in Java by using static analyses. Our approach is based upon a flow-sensitive intraprocedural analysis called variable constraint analysis (VCA). VCA collects constraints between locals related to array references. The…

E-commerce is a new way of doing business. It is becoming increasingly important to everybody. The objective of this thesis is to compare various design approaches and to find out the best solution for small businesses. Some commonly used technologies…

In designing compiler analyses and optimisations, the choice of intermediate representation (IR) is a crucial one. Static Single Assignment (SSA) form in particular is an IR with interesting properties, enabling certain analyses and optimisations to be more easily implemented while…

Side-effect analysis gives information about the set of locations that a statement may read or modify. This analysis can provide information useful in a compiler for performing aggressive optimizations. The impact of the use of side-effect analysis in compiler optimizations…

A fundamental problem in interprocedural program analyses is the need to represent and manipulate collections of large sets. Binary Decision Diagrams (BDDs) are a data structure widely used in model checking to compactly encode large state sets. In this dissertation,…

This thesis documents the design and implementation of computations, the procedural abstraction facility of a database programming language. Conceived as a special form of relation, computations fit neatly into the relational model. A computation is defined over a set of…

This thesis discusses the design and implementation of a relational database programming language, focusing on the domain algebra for nested relations. While the relational algebra provides operations to manipulate relations as data primitives, the domain algebra allows the manipulation of…

Nondeterminism makes distributed concurrent systems difficult to test, monitor and control. An execution of a message-passing system is nondeterministic when message races exist. Message race occurs when, e.g., multiple conflicting requests from different clients are competing to be executed within…

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…