Software engineers are faced with a dilemma. They want to write general and wellstructured
programs that are flexible and easy to maintain. On the other hand, generality has a price …

Heap data is potentially unbounded and seemingly arbitrary. Hence, unlike stack and static
data, heap data cannot be abstracted in terms of a fixed set of program variables. This …

This paper reports on the design, implementation, and empirical results of a new method for
dealing with the aliasing problem in C. The method is based on approximating the points-to …

This paper presents the first-ever compile-time method for allocating a portion of the heap
data to scratch-pad memory. A scratch-pad is a fast directly addressed compiler-managed …

Improperly bounded program inputs present a major class of program defects. In secure
applications, these bugs can be exploited by malicious users, allowing them to overwrite …

Guarded Kleene Algebra with Tests (GKAT) is a variation on Kleene Algebra with Tests
(KAT) that arises by restricting the union (+) and iteration (*) operations from KAT to …

In designing optimizing and parallelizing compilers, it is often simpler and more efficient to
deal with programs that have structured control flow. Although most programmers naturally …

Many embedded systems feature processors coupled with a small and fast scratchpad
memory. To the difference with caches, allocation of data to scratchpad memory must be …

This paper addresses the problem of how to apply pointer analysis to a wide variety of
compiler applications. We are not presenting a new pointer analysis. Rather, we focus on …

Optimizing compilers require accurate dependence testing to enable numerous,
performance-enhancing transformations. However, data dependence testing is a difficult …