Abstract
Non-determinism in concurrent programs makes their debugging much more challenging than that in sequential programs. To mitigate such difficulties, we propose a new technique to automatically locate buggy shared memory accesses that triggered concurrency bugs. Compared to existing fault localization techniques that are based on empirical statistical approaches, this technique has two advantages. First, as long as enough successful runs of a concurrent program are collected, the proposed technique can locate buggy memory accesses to the shared data even with only one single failed run captured, as opposed to the need of capturing multiple failed runs in other statistical approaches. Second, the proposed technique is more precise because it considers memory accesses in those failed runs that terminate prematurely.
Original language | English (US) |
---|---|
Pages (from-to) | 375-376 |
Number of pages | 2 |
Journal | ACM SIGPLAN Notices |
Volume | 49 |
Issue number | 8 |
DOIs | |
State | Published - Feb 6 2014 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2014 Owner/Author.
Keywords
- bug scenario
- concurrency bug localization
- shared memory access pair
- test procedure