Sciweavers

367 search results - page 4 / 74
» Partial evaluation of machine code
Sort
View
PLDI
1995
ACM
14 years 1 months ago
Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
Partial Redundancy Elimination PRE is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redun...
Gagan Agrawal, Joel H. Saltz, Raja Das
PLDI
1996
ACM
14 years 1 months ago
Realistic Compilation by Partial Evaluation
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...
Michael Sperber, Peter Thiemann
ITC
1998
IEEE
126views Hardware» more  ITC 1998»
14 years 1 months ago
A comprehensive approach to the partial scan problem using implicit state enumeration
This paper presents a novel technique to evaluate the noncontrollability measures of state registers for partial scan design. Our model uses implicit techniques for finite state ma...
Priyank Kalla, Maciej J. Ciesielski
ICCL
1998
IEEE
14 years 2 months ago
Controlled Self-Applicable On-Line Partial Evaluation, Using Strategies
On-line partial evaluators are hardly ever selfapplicable, because the complexity of deciding whether to residualize terms causes combinatorial explosion when self-application is ...
M. Beckman, Samuel N. Kamin
LOPSTR
2009
Springer
14 years 4 months ago
Towards Just-In-Time Partial Evaluation of Prolog
Abstract. We introduce a just-in-time specializer for Prolog. Just-intime specialization attempts to unify of the concepts and benefits of partial evaluation (PE) and just-in-time...
Carl Friedrich Bolz, Michael Leuschel, Armin Rigo