Comment on RaceDetectionLinks in data-race-test
data-ra...@googlecode.com
just a new links
#Tayfun Elmas, Shaz Qadeer, Serdar Tasiran. Goldilocks: Efficiently
Computing the Happens-Before Relation Using Locksets. // First combined
international workshops, FATES 2006 and RV 2006, Seattle, WA, USA, 2006.
#Eric Bodden. Racer: Effective Race Detection Using AspectJ. McGill
University, 2008.
For more information:
http://code.google.com/p/data-race-test/wiki/RaceDetectionLinks
data-ra...@googlecode.com
tools
# [http://en.wikipedia.org/wiki/Java_Pathfinder Java Path Finder] - Java
virtual machine which explore thread schedules and noondetermenistic
choices given by users. Thus it checks the Java program on all different
interleavings of threads. As a component it implements Goldilocks algorithm
# [http://www.cs.umd.edu/class/spring2004/cmsc433/checkSync.html
CheckSync] - implements Eraser
# [http://www.fit.vutbr.cz/research/groups/verifit/ Verifit] based on
ConTest, implements Eraser
# [http://www.haifa.ibm.com/projects/verification/contest/index.html
ConTest] - A Tool for Testing Multi-threaded Java Applications
# [http://www.bodden.de/research/past-research/racer/ Racer] is a new
Eraser-based algorithm to detect data races in multi-threaded Java programs
data-ra...@googlecode.com
[http://www.corensic.com Corensic] provides Jinx for both Linux and
Windows. Starting in version 1.3, the Linux version of Jinx provides a
report showing a list of races that it has detected. This is a natural
side effect of trying to find unusual thread interleavings that cause data
corruption or crashes.
data-ra...@googlecode.com
A new paper on data race detection:
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5764688
data-ra...@googlecode.com
one paper about helgrind+ which based on valgrind-helgrind:
Helgrind+: An efficient dynamic race detector
http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5160998
data-ra...@googlecode.com
data-ra...@googlecode.com
New paper:
http://www.computer.org/csdl/trans/td/preprint/06583165-abs.html
Data races are a common problem on shared-memory parallel computers,
including multicores. Analysis programs called race detectors help find and
eliminate them. However, current race detectors are geared for specific
concurrency libraries. When programmers use libraries unknown to a given
detector, the detector becomes useless or requires extensive reprogramming.
We introduce a new synchronization detection mechanism that is independent
of concurrency libraries. It dynamically detects synchronization constructs
based on a characteristic code pattern. The approach is non-intrusive and
applicable to various concurrency libraries. Experimental results confirm
that the approach identifies synchronizations and detects data races
regardless of the concurrency libraries involved. With this mechanism, race
detectors can be written once and need not be adapted to particular
libraries.
For more information:
https://code.google.com/p/data-race-test/wiki/RaceDetectionLinks