2300 search results - page 132 / 460 » Maximally Concurrent Programs |
185
click to vote
PLDI
2012
ACM
13 years 8 months ago
2012
ACM
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
293
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
145
click to vote
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
188
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
Transactional Memory (TM) is a promising technique that simplifies parallel programming for shared-memory applications. To date, most TM systems have been designed to efficientl...
170
click to vote
CONCUR
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...