1911 search results - page 208 / 383 » Program analysis for code duplication in logic programs |
260
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
247
Voted
POPL
2008
ACM
16 years 5 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
128
click to vote
SIGSOFT
2006
ACM
16 years 5 months ago
2006
ACM
It is usually assumed that the implementation of exception handling can be better modularized by the use of aspectoriented programming (AOP). However, the trade-offs involved in u...
140
click to vote
PPDP
2000
Springer
15 years 8 months ago
2000
Springer
an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of tech...
181
click to vote
CF
2006
ACM
15 years 7 months ago
2006
ACM
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...