2000 search results - page 223 / 400 » Program Transformation and Proof Transformation |
160
click to vote
IEEEPACT
1999
IEEE
15 years 8 months ago
1999
IEEE
Automatic parallelization of general-purpose programs is still not possible in general in the presence of irregular data structures and complex control-flows. One promising strate...
137
click to vote
EUROPAR
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. In an interpreted execution there is an interdependence between the interpreter's execution and the interpreted application's execution; the implementation of t...
152
click to vote
FM
2006
Springer
15 years 7 months ago
2006
Springer
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
118
click to vote
LCPC
2000
Springer
15 years 7 months ago
2000
Springer
This paper presents recursion unrolling, a technique for improving the performance of recursive computations. Conceptually, recursion unrolling inlines recursive calls to reduce c...
165
click to vote
PODS
1991
ACM
15 years 7 months ago
1991
ACM
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...