95 search results - page 3 / 19 » Efficient Data Race Detection for Async-Finish Parallelism |
OOPSLA
2004
Springer
13 years 11 months ago
2004
Springer
The main goal of this PhD thesis is to propose and implement a methodology for the construction of programs based on the SCOOP model, and for modular reasoning about their correct...
PPOPP
2009
ACM
14 years 6 months ago
2009
ACM
Because data races represent a hard-to-manage class of errors in concurrent programs, numerous approaches to detect them have been proposed and evaluated. We specifically consider...
PPOPP
2003
ACM
13 years 11 months ago
2003
ACM
We present a new method for dynamically detecting potential data races in multithreaded programs. Our method improves on the state of the art in accuracy, in usability, and in ove...
CORR
2011
Springer
13 years 9 days ago
2011
Springer
—We present a new model for distributed shared memory systems, based on remote data accesses. Such features are offered by network interface cards that allow one-sided operations...
ICCS
2001
Springer
13 years 10 months ago
2001
Springer
This paper presents a tool that enables programmers to use cyclic debugging techniques for debugging non-deterministic parallel programs. The solution consists of a combination of ...