PLDI
2010
ACM
13 years 6 months ago
2010
ACM
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...
PLDI
2010
ACM
13 years 7 months ago
2010
ACM
Applications composed of multiple parallel libraries perform poorly when those libraries interfere with one another by obliviously using the same physical cores, leading to destru...
PLDI
2010
ACM
13 years 7 months ago
2010
ACM
We describe an automatic verification method to check whether transactional memories ensure strict serializability--a key property assumed of the transactional interface. Our main...
PLDI
2010
ACM
13 years 8 months ago
2010
ACM
Runtime bloat degrades significantly the performance and scalability of software systems. An important source of bloat is the inefficient use of containers. It is expensive to cre...
PLDI
2010
ACM
13 years 8 months ago
2010
ACM
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
PLDI
2010
ACM
13 years 8 months ago
2010
ACM
PLDI
2010
ACM
13 years 8 months ago
2010
ACM
PLDI
2010
ACM
13 years 8 months ago
2010
ACM
While iterative optimization has become a popular compiler optimization approach, it is based on a premise which has never been truly evaluated: that it is possible to learn the b...
PLDI
2010
ACM
13 years 9 months ago
2010
ACM
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
PLDI
2010
ACM
13 years 9 months ago
2010
ACM
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...