Dynamic race detection techniques for interrupt-driven programs
- Authors
- Tchamgoue, G.M.; Kim, K.H.; Jun, Y.-K.
- Issue Date
- 2012
- Keywords
- Data races; dynamic race detection; interrupt; interrupt handlers
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.7709 LNCS, pp 148 - 153
- Pages
- 6
- Indexed
- SCOPUS
- Journal Title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Volume
- 7709 LNCS
- Start Page
- 148
- End Page
- 153
- URI
- https://scholarworks.gnu.ac.kr/handle/sw.gnu/23355
- DOI
- 10.1007/978-3-642-35585-1_20
- ISSN
- 0302-9743
1611-3349
- Abstract
- Data races are notorious concurrency bugs that are difficult to be reproduced and may lead programs into unintended nondeterministic executions. Asynchronous interrupts introduce fine-grained parallelism into interrupt-driven programs making them prone to data races and hard to be thoroughly tested and debugged. Unfortunately, only few tools and techniques have been proposed for dynamic data race detection in interrupt-driven programs that are however widely used in embedded systems. This paper surveys the existing dynamic race detection techniques for interrupt-driven programs, analyzes them to circumscribes the problems they face in reporting data races, and finally highlights the challenges that a dynamic race detection for interrupt-driven program needs to overcome. ? 2012 Springer-Verlag.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - 공과대학 > Department of Aerospace and Software Engineering > Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.