CC
2001
Springer
13 years 10 months ago
2001
Springer
Compilers can exploit knowledge that a variable has a fixed known value at a program point for optimizations such as code specialization and constant folding. Recent work has shown...
CC
2001
Springer
13 years 10 months ago
2001
Springer
Large programs are typically built from separate modules. Traditional whole-program analysis cannot be used in the context of such modular development. In this paper we consider an...
CC
2001
Springer
13 years 10 months ago
2001
Springer
SmartTools is a development environment generator that provides a structure editor and semantic tools as main features. The well-known visitor pattern technique is commonly used fo...
CC
2001
Springer
13 years 11 months ago
2001
Springer
CC
2001
Springer
13 years 11 months ago
2001
Springer
Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scann...
CC
2001
Springer
13 years 11 months ago
2001
Springer
This paper introduces design-driven compilation, an approach in which the compiler uses design information to drive its analysis and verify that the program conforms to its design....
CC
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. This paper presents a framework for supporting the optimization of Java programs using attributes in Java class files. We show how class file attributes may be used to ...
CC
2001
Springer
13 years 11 months ago
2001
Springer
We study the application of a standard model checker tool, Spin, to the well-known problem of computing a may-alias relation for a C program. A precise may-alias relation can signi...
CC
2001
Springer
13 years 11 months ago
2001
Springer
CC
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...