The widening gap between processor and memory speeds renders data locality optimization a very important issue in compilers. Throughout the years hardware designers and compiler writers focused on optimizing data cache locality using intelligent cache management mechanisms and program-level transformations, respectively. While pure compiler-oriented techniques are quite successful in optimizing...

An optimizing compiler typically uses multiple program representations at diierent levels of program and performance abstractions in order to be able to perform transformations that { at least in the majority of cases { will lead to an overall improvement in program performance. The complexities of the program and performance abstractions used to formulate compiler optimization problems have to...

Languages with implicit parallelism are easier to program in than those with explicit parallelism, but finding and efficiently exploiting parallelism in general-purpose programming languages by parallelizing compilers is hard. A compiler for a Very High Level Language, designed for a specific application domain, has more knowledge about its application domain and may use this knowledge to gener...

Translation validation was introduced as a technique to formally verify the correctness of code generators that attempts to ensure that program transformations preserve the semantics of input program. In this work, we adopt this approach to construct a validator that formally verifies the preservation of clock semantics during the Signal compiler transformations. The clock semantics is represen...

An important problem facing parallelizing compilers for distributed memory mimd machines is that of distributing data across processors. This distribution aaects the amout of data movements among processors that is required to execute the computations of the input program. This work proposes a branch{and{bound based method to automatically compute a distribution for the arrays of the input prog...

A design for a skeleton based parallelising compiler for a pure functional subset of Standard ML is presented. The compiler will use Structural Operational Semantics based prototype instrumentation to determine communication and processing costs at sites of higher order function use. Useful parallelism will be identiied through performance models for equivalent algorithmic skeletons. Parallelis...

The paper presents a simple representation of C expressions and an algorithm that translates C expressions into this form. The representation can be used as a simple model when designing program analyses. At the same time, it can be used as a compiler intermediate representation to build actual analysis implementations. We describe a formulation of a flow-insensitive, but field-sensitive points...

In this paper, we present several tools for analyzing parallel programs. The tools are built on top of a compiler infrastructure, which provides advanced capabilities for symbolic program analysis and manipulation. The tools can display characteristics of a program and relate this information to data gathered from instrumented program runs and other performance analysis tools. They also support...

A symbolic version of an operation on values is a corresponding operation on program texts. For example, symbolic composition of two programs p, q yields a program whose meaning is the (mathematical) composition of the meanings of p and q. Another example is symbolic specialization of a function to a known first argument value. This operation, given the first argument, transforms a two-input pr...

To compete with optimized C, object-oriented languages need classical optimizations as well as speci c object-oriented optimizations. Therefore, a compiler infrastructure that enables object-oriented compiler research is of great interest for the research community. The SUIF compiler system with the OSUIF extension o ers such a research environment. SUIF de nes an intermediate representation fo...