Introduction Imperative program optimizations based on data-flow analyses are usually presented in an algorithmic manner, whereby the algorithms typically do not work directly on the given program, but rather on an intermediate form such as its control-flow graph. This is a good way to go about optimizing programs, but it is not an ideal presentation of what is done, if the optimizations are required to have justifications that can be communicated. In application
We develop an explicit two level system that allows programmers to reason about the behavior of effe...
Building verified compilers is difficult, especially when complex analyses such as type checking or ...
This paper examines a family of program test data selection criteria derived from data flow analysis...
AbstractWe demonstrate a method for describing data-flow analyses based program optimizations as com...
We demonstrate a method for describing data-flow analyses based program opti-mizations as compositio...
An analysis method for specialization of imperative programs is described in this paper. This anal-y...
. This paper describes a general purpose program analysis that computes global control-flow and data...
In this paper we present an intermediate program representation, called the program dependence graph...
We show that a wide class of bidirectional data-flow analyses and program optimizations based on the...
Our goal is to develop a new and highly flexible approach to program optimization. Instead of apply...
Numerical design optimization algorithms are highly sensitive to the particular formulation of the o...
Automatic optimizers for computer programs work with a fixed list of rote transformations, while hu...
International audienceWe discuss the design and the implementation of Locus, a system and a language...
In this paper we present an intermediate program representation, called a program dependence graph o...
AbstractWe show that a large class of data-flow analyses for imperative languages are describable as...
We develop an explicit two level system that allows programmers to reason about the behavior of effe...
Building verified compilers is difficult, especially when complex analyses such as type checking or ...
This paper examines a family of program test data selection criteria derived from data flow analysis...
AbstractWe demonstrate a method for describing data-flow analyses based program optimizations as com...
We demonstrate a method for describing data-flow analyses based program opti-mizations as compositio...
An analysis method for specialization of imperative programs is described in this paper. This anal-y...
. This paper describes a general purpose program analysis that computes global control-flow and data...
In this paper we present an intermediate program representation, called the program dependence graph...
We show that a wide class of bidirectional data-flow analyses and program optimizations based on the...
Our goal is to develop a new and highly flexible approach to program optimization. Instead of apply...
Numerical design optimization algorithms are highly sensitive to the particular formulation of the o...
Automatic optimizers for computer programs work with a fixed list of rote transformations, while hu...
International audienceWe discuss the design and the implementation of Locus, a system and a language...
In this paper we present an intermediate program representation, called a program dependence graph o...
AbstractWe show that a large class of data-flow analyses for imperative languages are describable as...
We develop an explicit two level system that allows programmers to reason about the behavior of effe...
Building verified compilers is difficult, especially when complex analyses such as type checking or ...
This paper examines a family of program test data selection criteria derived from data flow analysis...