1557 search results - page 118 / 312 » Programming up to Congruence |
WOMPAT
2001
Springer
15 years 3 months ago
2001
Springer
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...
PLDI
2000
ACM
15 years 3 months ago
2000
ACM
We present a new limited form of interprocedural analysis called field analysis that can be used by a compiler to reduce the costs of modern language features such as objectorien...
SAC
1998
ACM
15 years 3 months ago
1998
ACM
This paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time...
IFL
1997
Springer
15 years 3 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
107
click to vote
ICSM
1994
IEEE
15 years 3 months ago
1994
IEEE
In order to improve software maintenance processes, we need to be able to first characterize and assess them. This task needs to be performed in depth and with objectivity since t...