1953 search results - page 234 / 391 » codes 2010 |
128
click to vote
ESOP
2010
Springer
16 years 2 months ago
2010
Springer
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
124
click to vote
PPOPP
2010
ACM
16 years 2 months ago
2010
ACM
This paper addresses the problem of extracting coarse-grained parallelism from large sequential code. It builds on BOP, a system for software speculative parallelization. BOP lets...
139
click to vote
PPOPP
2010
ACM
16 years 2 months ago
2010
ACM
Transactional memory promises to make parallel programming easier than with fine-grained locking, while performing just as well. This performance claim is not always borne out bec...
162
click to vote
PPOPP
2010
ACM
16 years 2 months ago
2010
ACM
This poster is a case study on the application of a novel programming model, called Concurrent Collections (CnC), to the implementation of an asynchronous-parallel algorithm for c...
142
click to vote
ASM
2010
ASM
16 years 2 months ago
2010
ASM
The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly i...