Abstract. Existing partial evaluators usually fix the strategy for bind-ing-time analysis. But a single strategy cannot fulfill all goals without leading to compromises regarding precision, termination, and code ex-plosion in partial evaluators. Our goal is to improve the usability of partial evaluator systems by developing an adaptive approach that can accommodate a variety of different strategies ranging from maximally polyvariant to entirely uniform analysis, and thereby make offline spe-cialization more practical in a realistic setting. The core of the analysis has been implemented in FSpec, an offline partial evaluator for a subset of Fortran 77.
Binding-time analysis is important in partial evaluators. Its task is to determine which parts of a ...
Charles Consel and Siau Cheng Khoo have developed a technique for parameterizing partial evaluation ...
Binding time analysis is important in partial evaluators. Its task is to determine which parts of a...
Abstract. Existing partial evaluators usually ¯x the strategy for bind-ing-time analysis. But a sing...
Partial evaluation is a source to source program transformation that makes use of symbolic interpre-...
. Binding-time analysis is a crucial part of offline partial evaluation. It is often specified as a ...
. We have developed and implemented a partial evaluator for a subset of Fortran 77. A partial evalua...
Abstract. We have developed and implemented a partial evaluator for a subset of Fortran 77. A partia...
In program optimisation an analysis determines some information about a portion of a program, which ...
We describe the design and implementation of an off-line partial evaluator for Standard ML programs....
In program optimisation an analysis determines some information about a portion of a program, which ...
Polyvariant expansion is a binding-time-improving transformation for offline partial evaluation. We ...
AbstractSince a binding-time analysis determines how an off-line partial evaluator will specialize a...
: As partial evaluation gets more mature, it is now possible to use this program transformation tech...
This paper presents an algorithm for off-line partial evaluation of machine code. The algorithm foll...
Binding-time analysis is important in partial evaluators. Its task is to determine which parts of a ...
Charles Consel and Siau Cheng Khoo have developed a technique for parameterizing partial evaluation ...
Binding time analysis is important in partial evaluators. Its task is to determine which parts of a...
Abstract. Existing partial evaluators usually ¯x the strategy for bind-ing-time analysis. But a sing...
Partial evaluation is a source to source program transformation that makes use of symbolic interpre-...
. Binding-time analysis is a crucial part of offline partial evaluation. It is often specified as a ...
. We have developed and implemented a partial evaluator for a subset of Fortran 77. A partial evalua...
Abstract. We have developed and implemented a partial evaluator for a subset of Fortran 77. A partia...
In program optimisation an analysis determines some information about a portion of a program, which ...
We describe the design and implementation of an off-line partial evaluator for Standard ML programs....
In program optimisation an analysis determines some information about a portion of a program, which ...
Polyvariant expansion is a binding-time-improving transformation for offline partial evaluation. We ...
AbstractSince a binding-time analysis determines how an off-line partial evaluator will specialize a...
: As partial evaluation gets more mature, it is now possible to use this program transformation tech...
This paper presents an algorithm for off-line partial evaluation of machine code. The algorithm foll...
Binding-time analysis is important in partial evaluators. Its task is to determine which parts of a ...
Charles Consel and Siau Cheng Khoo have developed a technique for parameterizing partial evaluation ...
Binding time analysis is important in partial evaluators. Its task is to determine which parts of a...