Sciweavers

120 search results - page 16 / 24
» Polyhedral Analysis for Synchronous Languages
Sort
View
POPL
2010
ACM
14 years 4 months ago
Dynamically Checking Ownership Policies in Concurrent C/C++ Programs
Concurrent programming errors arise when threads share data incorrectly. Programmers often avoid these errors by using synchronization to enforce a simple ownership policy: data i...
Jean-Phillipe Martin, Michael Hicks, Manuel Costa,...
ASPLOS
1996
ACM
13 years 11 months ago
An Integrated Compile-Time/Run-Time Software Distributed Shared Memory System
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
Sandhya Dwarkadas, Alan L. Cox, Willy Zwaenepoel
POPL
2009
ACM
14 years 1 months ago
Comparing the performance of concurrent linked-list implementations in Haskell
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
Martin Sulzmann, Edmund S. L. Lam, Simon Marlow
GPCE
2004
Springer
14 years 3 days ago
Splice: Aspects That Analyze Programs
This paper describes Splice, a system for writing aspects that perform static program analyses to direct program modifications. The power of an inter-procedural data-flow analys...
Sean McDirmid, Wilson C. Hsieh
FPCA
1995
13 years 10 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein