21 search results - page 2 / 5 » A Deadlock-Free Semantics for Shared Memory Concurrency |
159
click to vote
ASIAN
2004
Springer
15 years 11 months ago
2004
Springer
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
151
click to vote
TLDI
2009
ACM
16 years 2 months ago
2009
ACM
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
166
click to vote
PVM
2010
Springer
15 years 3 months ago
2010
Springer
With the ever-increasing numbers of cores per node on HPC systems, applications are increasingly using threads to exploit the shared memory within a node, combined with MPI across ...
172
click to vote
ICTAC
2010
Springer
15 years 3 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
283
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...