169
click to vote
CC
14 years 11 months ago
2010 Springer 
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
121
click to vote
CC
15 years 8 months ago
2010 Springer 
Abstract. Scientists are increasingly using dynamic programming languages like Matlab for prototyping and implementation. Effectively compiling Matlab raises many challenges due t...
124
click to vote
CC
15 years 8 months ago
2010 Springer 
On Chip Multiprocessors (CMP), it is common that multiple cores share certain levels of cache. The sharing increases the contention in cache and memory-to-chip bandwidth, further h...
110
click to vote
CC
15 years 8 months ago
2010 Springer
Abstract. Following the translation validation approach to highassurance compilation, we describe a new algorithm for validating a posteriori the results of a run of register alloc...
105
click to vote
CC
15 years 8 months ago
2010 Springer
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
|
System Software