2000 search results - page 242 / 400 » Program Transformation and Proof Transformation |
134
click to vote
ASPLOS
1992
ACM
15 years 8 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...
135
click to vote
APLAS
2007
ACM
15 years 8 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...
164
click to vote
HOTSWUP
2009
ACM
15 years 7 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...
144
click to vote
CSMR
2004
IEEE
15 years 7 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...
120
click to vote
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...