ASP: Abstraction Subspace Partitioning for Detection of Atomicity Violations with an Empirical Study
| Autor: | W. K. Chan, Shangru Wu, Changjiang Jia, Chunbai Yang |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Atomicity
021103 operations research Theoretical computer science Computer science media_common.quotation_subject Concurrency 0211 other engineering and technologies 020207 software engineering 02 engineering and technology Abstraction layer Concurrency control Computational Theory and Mathematics Debugging Software bug Hardware and Architecture Multithreading Signal Processing 0202 electrical engineering electronic engineering information engineering Concurrent computing Subspace topology media_common Abstraction (linguistics) |
| Zdroj: | IEEE Transactions on Parallel and Distributed Systems. 27:724-734 |
| ISSN: | 2161-9883 1045-9219 |
| DOI: | 10.1109/tpds.2015.2412544 |
| Popis: | Dynamic concurrency bug detectors predict and then examine suspicious instances of atomicity violations from executions of multithreaded programs. Only few predicted instances are real bugs. Prioritizing such instances can make the examinations cost-effective, but is there any design factor exhibiting significant influence? This work presents the first controlled experiment that studies two design factors, abstraction level and subspace, in partitioning such instances through 35 resultant partition-based techniques on 10 benchmarks with known vulnerability-related bugs. The empirical analysis reveals significant findings. First, partition-based prioritization can significantly improve the fault detection rate. Second, coarse-grained techniques are more effective than fine-grained ones, and using some one-dimensional subspaces is more effective than using other dimensional subspaces. Third, eight previously unknown techniques can be more effective than the technique modeled after a state-of-the-art dynamic detector. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|