2300 search results - page 132 / 460 » Maximally Concurrent Programs |
116
Voted
PLDI
2012
ACM
13 years 3 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...
205
Voted
POPL
2009
ACM
16 years 1 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...
83
Voted
EUROPAR
2003
Springer
15 years 6 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...
122
Voted
SPAA
2010
ACM
15 years 5 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...
CONCUR
2007
Springer
15 years 7 months 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...