Goldilocks: Efficiently Computing the Happens-Before Relation Using Locksets
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 193-208
- https://doi.org/10.1007/11940197_13
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- RaceTrackPublished by Association for Computing Machinery (ACM) ,2005
- Efficient on-the-fly data race detection in multithreaded C++ programsPublished by Association for Computing Machinery (ACM) ,2003
- Efficient and precise datarace detection for multithreaded object-oriented programsPublished by Association for Computing Machinery (ACM) ,2002
- Type-based race detection for JavaPublished by Association for Computing Machinery (ACM) ,2000
- Runtime Checking of Multithreaded Applications with Visual ThreadsPublished by Springer Nature ,2000
- RecPlayACM Transactions on Computer Systems, 1999
- Detecting data races in Cilk programs that use locksPublished by Association for Computing Machinery (ACM) ,1998
- EraserACM Transactions on Computer Systems, 1997
- What are race conditions?ACM Letters on Programming Languages and Systems, 1992
- On-the-fly detection of access anomaliesPublished by Association for Computing Machinery (ACM) ,1989