2466 search results - page 239 / 494 » Concurrent Clustered Programming |
117
Voted
DC
2010
15 years 20 days ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
200
Voted
CONCUR
2011
Springer
14 years 12 days ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
110
Voted
PLDI
2009
ACM
15 years 7 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
138
click to vote
DAC
2007
ACM
16 years 1 months ago
2007
ACM
This paper argues for an implicitly parallel programming model for many-core microprocessors, and provides initial technical approaches towards this goal. In an implicitly paralle...
114
Voted
SAS
2012
Springer
13 years 3 months ago
2012
Springer
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...