603 search results - page 79 / 121 » concurrency 2010 |
POPL
2010
ACM
15 years 7 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
EUROSYS
2010
ACM
15 years 6 months ago
2010
ACM
Debugging real systems is hard, requires deep knowledge of the code, and is time-consuming. Bug reports rarely provide sufficient information, thus forcing developers to turn int...
103
click to vote
EUROSYS
2010
ACM
15 years 6 months ago
2010
ACM
Bugs in concurrent programs are extremely difficult to find and fix during testing. In this paper, we propose Kivati, which can efficiently detect and prevent atomicity violat...
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of...
DAC
2010
ACM
15 years 1 months ago
2010
ACM
We propose a parallel global routing algorithm that concurrently processes routing subproblems corresponding to rectangular subregions covering the chip area. The algorithm uses a...