Aspect-Oriented Race Detection in Java
Kaydedildi:
| Yayımlandı: | IEEE Transactions on Software Engineering vol. 36, no. 4 (Jul/Aug 2010), p. 509 |
|---|---|
| Yazar: | |
| Diğer Yazarlar: | |
| Baskı/Yayın Bilgisi: |
IEEE Computer Society
|
| Konular: | |
| Online Erişim: | Citation/Abstract Full Text - PDF |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|
| Özet: | In the past, researchers have developed specialized programs to aid programmers in detecting concurrent programming errors such as deadlocks, livelocks, starvation, and data races. In this work, we propose a language extension to the aspect-oriented programming language AspectJ, in the form of three new pointcuts, lock(), unlock(), and maybeShared(). These pointcuts allow programmers to monitor program events where locks are granted or handed back, and where values are accessed that may be shared among multiple Java threads. We decide thread locality using a static thread-local-objects analysis developed by others. Using the three new primitive pointcuts, researchers can directly implement efficient monitoring algorithms to detect concurrent-programming errors online. As an example, we describe a new algorithm which we call Racer, an adaption of the well-known Eraser algorithm to the memory model of Java. We implemented the new pointcuts as an extension to the AspectBench Compiler, implemented the Racer algorithm using this language extension, and then applied the algorithm to the NASA K9 Rover Executive and two smaller programs. Our experiments demonstrate that our implementation is effective in finding subtle data races. In the Rover Executive, Racer finds 12 data races, with no false warnings. Only one of these races was previously known. |
|---|---|
| ISSN: | 0098-5589 1939-3520 |
| DOI: | 10.1109/TSE.2010.25 |
| Kaynak: | ABI/INFORM Global |