1882 search results - page 238 / 377 » Transformational Programming and Forests |
153
click to vote
PLDI
1998
ACM
15 years 10 months ago
1998
ACM
The conditional branch has long been considered an expensive operation. The relative cost of conditional branches has increased as recently designed machines are now relying on de...
162
click to vote
ASPLOS
1992
ACM
15 years 10 months ago
1992
ACM
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...
160
Voted
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
184
click to vote
HOTSWUP
2009
ACM
15 years 10 months ago
2009
ACM
Recent years have seen significant advances in dynamic software updating (DSU) systems, which allow programs to be patched on the fly. However, a significant challenge remains: Ho...
173
Voted
CSMR
2004
IEEE
15 years 10 months ago
2004
IEEE
Automatic analysis of programs with preprocessing directives and conditional compilation is challenging. The difficulties range from parsing to program understanding. Symbolic eva...