检索结果-内蒙古大学图书馆

Collaborative Technique for concurrency bug detection

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2015年第2期43卷 260-285页

作者： Wu, Zhendong Lu, Kai Wang, Xiaoping Zhou, Xu Natl Univ Def Technol Sci & Technol Parallel & Distributed Proc Lab Changsha Hunan Peoples R China Natl Univ Def Technol Coll Comp Changsha Hunan Peoples R China

concurrency bugs hidden in deployed software can cause severe failures and real-world disasters. They are notoriously difficult to detect during in-house testing due to huge and non-deterministic interleaving space. Unfortunately, the multicore technology trend worsens this problem. Unlike previous work that detects particular concurrency bugs (e.g., data races and atomicity violations), we target harmful concurrency bugs that cause program failures. In order to detect harmful concurrency bugs effectively and efficiently, we propose an innovative, collaborative approach called ColFinder. First, ColFinder statically analyzes the program to identify potential concurrency bugs. ColFinder then uses static program slicing to get smaller programs with respect to potential concurrency bugs. Finally, ColFinder dynamically controls thread scheduler to force multiple threads access the same memory location, verifying whether the potential concurrency bug will cause program failure. If a failure occurs, a harmful concurrency bug is detected. We have implemented ColFinder as a prototype tool and have experimented on a number of real-world concurrent programs. The probability of bug manifestation in these programs is only 0.64 % averagely during native execution. It is significantly raised to 90 % with ColFinder. The runtime overhead imposed by many previous approaches is always more than 10. The overhead of ColFinder is more acceptable, with an average of 79 %. Additionally, to our knowledge, this is the first technique that introduces program slicing to reduce the time of bug manifestation, with an average of 33 %.

关键词： Collaborative concurrency bug detection Static program slicing Dynamic active tester

来源：评论

学校读者我要写书评

暂无评论

A systematic survey on automated concurrency bug detection, exposing, avoidance, and fixing techniques

引用

SOFTWARE QUALITY JOURNAL 2018年第3期26卷 855-889页

作者： Fu, Haojie Wang, Zan Chen, Xiang Fan, Xiangyu Tianjin Univ Sch Comp Software Tianjin Peoples R China Nantong Univ Sch Comp Sci & Technol Nantong Peoples R China

Currently, concurrent programs are becoming increasingly widespread to meet the demands of the rapid development of multi-core hardware. However, it could be quite expensive and challenging to guarantee the correctness and efficiency of concurrent programs. In this paper, we provide a systematic review of the existing research on fighting against concurrency bugs, including automated concurrency bug exposing, detection, avoidance, and fixing. These four categories cover the different aspects of concurrency bug problems and are complementary to each other. For each category, we survey the motivation, key issues, solutions, and the current state of the art. In addition, we summarize the classical benchmarks widely used in previous empirical studies and the contribution of active research groups. Finally, some future research directions on concurrency bugs are recommended. We believe this survey would be useful for concurrency programmers and researchers.

关键词： concurrency bug detection concurrency bug exposing concurrency bug avoidance concurrency bug fixing

来源：评论

学校读者我要写书评

暂无评论

Surveying concurrency bug detectors based on types of detected bugs

引用

Science China(Information Sciences) 2017年第3期60卷 5-31页

作者： Zhendong WU Kai LU Xiaoping WANG Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology College of Computer National University of Defense Technology

concurrency bugs widely exist in concurrent programs and have caused severe failures in the real world. Researchers have made significant progress in detecting concurrency bugs, which improves software reliability. In this paper, we survey the most up-to-date and well-known concurrency bug detectors. We categorize the existing detectors based on the types of concurrency bugs. Consequently, we analyze data race detectors, atomicity violation detectors, order violation detectors, and deadlock detectors, respectively. We also discuss some other techniques which are mostly related to concurrency bug detection, including schedule bounding techniques, interleaving optimizing techniques, path expanding techniques, and deterministic replay techniques. Additionally, we statistically analyze the reviewed detectors and get some interesting findings, for instance, nearly 86% of previous detectors focus on data races and atomicity violations, and dynamic approaches are popular(74%). We also discuss the limitations of previous detectors, finding that 91% of previous detectors suffer from false negatives and 64% of previous detectors suffer from runtime overhead. Based on the reviewed detectors and statistical analysis, we conclude some future research directions, including accuracy, performance,applicability, and integrality.

关键词： concurrency bug detection data race atomicity violation order violation deadlock

来源：评论

学校读者我要写书评

暂无评论

Achieving High MAP-Coverage Through Pattern Constraint Reduction

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2023年第1期49卷 99-112页

作者： Zhao, Yingquan Wang, Zan Liu, Shuang Sun, Jun Chen, Junjie Chen, Xiang Tianjin Univ Coll Intelligence & Comp Tianjin 300072 Peoples R China Singapore Management Univ Sch Informat Syst Singapore 188065 Singapore Nantong Univ Sch Informat Sci & Technol Nantong 226007 Peoples R China

Testing multi-threaded programs is challenging due to the enormous space of thread interleavings. Recently, a code coverage criterion for multi-threaded programs called MAP-coverage has been proposed and shown to be effective for testing concurrent programs. Existing approaches for achieving high MAP-coverage are based on random testing with simple heuristics, which is ineffective in systematically triggering rare thread interleavings. In this study, we propose a novel approach called pattern constraint reduction (PCR), which employs optimized constraint solving to generate thread interleavings for high MAP-coverage. The idea is to iteratively encode and solve path conditions to generate thread interleavings which are guaranteed to improve MAP-coverage. Furthermore, we effectively apply interpolation techniques to reduce the efforts of constraint solving by avoiding solving infeasible constraints. The experiment results on 20 benchmark programs show that our approach complements existing random testing based approaches when there are rare failure-inducing interleaving in the whole search space. Specifically, PCR finds concurrency bugs faster in 18 out of 20 programs, with an average speedup of 4.2x and a maximum speedup of 11.4x.

关键词： Computer bugs Concurrent computing Instruction sets Programming Message systems Systematics Sun concurrency bug detection constraint solving coverage criteria thread-safe class

来源：评论

学校读者我要写书评

暂无评论

Hardware Support for Concurrent detection of Multiple concurrency bugs on Fused CPU-GPU Architectures

引用

IEEE TRANSACTIONS ON COMPUTERS 2016年第10期65卷 3083-3095页

作者： Zhang, Weihua Yu, Shiqiang Wang, Haojun Dai, Zhuofang Chen, Haibo Fudan Univ Software Sch Shanghai Key Lab Data Sci Shanghai Peoples R China Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai 200030 Peoples R China

Detecting concurrency bugs, such as data race, atomicity violation and order violation, is a cumbersome task for programmers. This situation is further being exacerbated due to the increasing number of cores in a single machine and the prevalence of threaded programming models. Unfortunately, many existing software-based approaches usually incur high runtime overhead or accuracy loss, while most hardware-based proposals usually focus on a specific type of bugs and thus are inflexible to detect a variety of concurrency bugs. In this paper, we propose Hydra, an approach that leverages massive parallelism and programmability of fused CPU-GPU architectures to simultaneously detect multiple concurrency bugs in threaded software, including data race, atomicity violation and order violation. Hydra extends contemporary fused CPU and GPU by introducing two modules: 1) a trace collecting module (TCM) that instruments and collects program behavior on CPU;2) a trace preprocessing module (TPM) that processes and then transfers the traces to GPU for bug detection. Furthermore, Hydra exploits three optimizations to improve speed and accuracy, which includes: 1). using the bloom filter to filter out unnecessary traces;2). avoiding eviction of shared traces;3). comparing only last-write traces for shared data with the happens-before relation. Hydra incurs small hardware complexity and requires no changes to internal critical-path processor components such as cache and its coherence protocol, and is with about 1.1 percent hardware overhead under a 32-core configuration. Experimental results show that Hydra only introduces about 0.18 percent overhead on average for detecting one type of bugs and 0.46 percent overhead for simultaneously detecting multiple bugs, yet with the similar detectability of a heavyweight software bug detector (e.g., Helgrind).

关键词： concurrency bug detection fused CPU-GPU architecture

来源：评论

学校读者我要写书评

暂无评论

Intrathread Method Orders Based Adaptive Testing of Concurrent Objects 18th

Intrathread Method Orders Based Adaptive Testing of Concurre...

引用

18th International Conference on Theoretical Aspects of Software Engineering (TASE)

作者： Dai, Yibo Wu, Peng Cui, Shecheng Ma, Linhai Chinese Acad Sci Key Lab Syst Software Beijing Peoples R China Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China Univ Chinese Acad Sci Hangzhou Inst Adv Study Hangzhou Peoples R China Univ Miami Dept Comp Sci Coral Gables FL 33124 USA

ISBN: (纸本)9783031646256;9783031646263

Concurrent data structures or classes are designed to provide secure access and simultaneous updates by multiple threads to shared objects in a concurrent environment, with the goal of enhancing parallelism and throughput. However, testing concurrent data structures poses significant challenges due to the potential explosions of concurrent test spaces, the variety of programming vulnerabilities, and the inherent nondeterminism of concurrent test executions. In this paper, we propose an Intrathread Method Orders based Adaptive concurrency Testing (IMOACT) framework for testing concurrent data structures. IMOACT can capture diverse behaviors of interthread method pairs through characterizing concurrent execution contexts with intrathread method orders. Moreover, IMOACT can adaptively optimize concurrent test executions by generating scheduling sequences based on key scheduling points visited so far, streamlining test generation and execution organically across multiple tests. Experimental case studies with typical C/C++ concurrent data structures demonstrate that IMOACT outperforms baseline approaches. On average, IMOACT promotes the effectiveness of detecting concurrency bugs by 65%, and achieves a speedup of 2.43x compared to the underlying state-of-the-art concurrency testing approach.

关键词： concurrent data structures concurrent object testing concurrency bug detection data race intrathread method order

来源：评论

学校读者我要写书评

暂无评论

Schfuzz: Detecting concurrency bugs with Feedback-Guided Fuzzing 18

Schfuzz: Detecting Concurrency Bugs with Feedback-Guided Fuz...

引用

18th International Conference on Evaluation of Novel Approaches to Software Engineering (ENASE)

作者： Ito, Hiromasa Matsubara, Yutaka Takada, Hiroaki Nagoya Univ Inst Innovat Future Soc Nagoya Aichi Japan Nagoya Univ Grad Sch Informat Nagoya Aichi Japan

ISBN: (纸本)9789897586477

It is challenging to detect concurrency bugs with fuzzing. There are two main reasons for this. First, manifesting them by exploring input space is inefficient because they only occur under specific interleavings. Second, re-giving an input detected a bug in a fuzzing campaign does not necessarily reproduce the bug because typical runtimes do not schedule threads deterministically. This research proposes Schfuzz, a novel approach for detecting concurrency bugs with feedback-guided fuzzing. This approach executes programs under test deterministically based on test cases generated by fuzzers. In addition, it feeds back dynamic memory-access orders to aid fuzzers in detecting concurrency bugs more efficiently and effectively. We evaluate Schfuzz with a hand-made motivating example and four benchmark programs from SCTBench (Thomson et al., 2016). The result shows that it can detect concurrency bugs more efficiently and effectively than traditional feedback-guided fuzzing.

关键词： Fuzzing concurrency Testing concurrency bug detection Feedback-Guided Fuzzing Memory-Access-Guided Fuzzing

来源：评论

学校读者我要写书评

暂无评论

TxRace: Efficient Data Race detection Using Commodity Hardware Transactional Memory 16

TxRace: Efficient Data Race Detection Using Commodity Hardwa...

引用

21st International Conference on Architectural Support for Programming Languages and Operating Systems

作者： Zhang, Tong Lee, Dongyoon Jung, Changhee Virginia Tech Blacksburg VA 24061 USA

ISBN: (纸本)9781450340915

Detecting data races is important for debugging shared-memory multithreaded programs, but the high runtime overhead prevents the wide use of dynamic data race detectors. This paper presents TxRace, a new software data race detector that leverages commodity hardware transactional memory (HTM) to speed up data race detection. TxRace instruments a multithreaded program to transform synchronization-free regions into transactions, and exploits the conflict detection mechanism of HTM for lightweight data race detection at runtime. However, the limitations of the current best-effort commodity HTMs expose several challenges in using them for data race detection: (1) lack of ability to pinpoint racy instructions, (2) false positives caused by cache line granularity of conflict detection, and (3) transactional aborts for non-conflict reasons (e.g., capacity or unknown). To overcome these challenges, TxRace performs lightweight HTM-based data race detection at first, and occasionally switches to slow yet precise data race detection only for the small fraction of execution intervals in which potential races are reported by HTM. According to the experimental results, TxRace reduces the average runtime overhead of dynamic data race detection from 11.68x to 4.65x with only a small number of false negatives.

关键词： data race concurrency bug detection hardware transactional memory dynamic program analysis

来源：评论

学校读者我要写书评

暂无评论

ARBALEST: Dynamic detection of Data Mapping Issues in Heterogeneous OpenMP Applications 35

ARBALEST: Dynamic Detection of Data Mapping Issues in Hetero...

引用

35th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Yu, Lechen Protze, Joachim Hernandez, Oscar Sarkar, Vivek Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Rhein Westfal TH Aachen IT Ctr Aachen Germany Oak Ridge Natl Lab Comp Sci Res Oak Ridge TN USA

ISBN: (纸本)9781665440660

From OpenMP 4.0 onwards, programmers can off-load code regions to accelerators by using the target offloading feature. However, incorrect usage of target offloading constructs may incur data mapping issues. A data mapping issue occurs when the host fails to observe updates on the accelerator or vice versa. It may further lead to multiple memory issues such as use of uninitialized memory, use of stale data, and data race. To the best of our knowledge, currently there is no prior work on dynamic detection of data mapping issues in heterogeneous OpenMP applications. In this paper, we identify possible root causes of data mapping issues in OpenMP's standard memory model and the unified memory model. We find that data mapping issues primarily result from incorrect settings of map and nowait clauses in target offloading constructs. Further, the novel unified memory model introduced in OpenMP 5.0 cannot avoid the occurrence of data mapping issues. To mitigate the difficulty of detecting data mapping issues, we propose ARBALEST, an on-the-fly data mapping issue detector for OpenMP applications. For each variable mapped to the accelerator, ARBALEST's detection algorithm leverages a state machine to track the last write's visibility. ARBALEST requires constant storage space for each memory location and takes amortized constant time per memory access. To demonstrate ARBALEST's effectiveness, an experimental comparison with four other dynamic analysis tools (Valgrind, Archer, AddressSanitizer, MemorySanitizer) has been carried out on a number of open-source benchmark suites. The evaluation results show that ARBALEST delivers demonstrably better precision than the other four tools, and its execution lime overhead is comparable to that of state-of-the-art dynamic analysis tools.

关键词： Dynamic Analysis concurrency bug detection Data Mapping Issue OpenMP Accelerator

来源：评论

学校读者我要写书评

暂无评论

A Case Study on Context Maintenance in Dynamic Hybrid Race Detectors 41

A Case Study on Context Maintenance in Dynamic Hybrid Race D...

引用

41st IEEE Annual Computer Software and Applications Conference (COMPSAC)

作者： Yang, Jialin Pobee, Ernest Bota Chan, W. K. City Univ Hong Kong Dept Comp Sci Tat Chee Ave Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781538603673

Many dynamic hybrid race detectors aim at detecting violations of the lockset discipline in execution traces of multithreaded programs. They are designed to abstract memory accesses appearing in traces as contexts. Nonetheless, they keep these contexts in different extents and partition the sets of contexts into equivalent classes of different granularity. In our case study, we compare three detectors using the PARSEC benchmark suite to examine the impact of using unrestricted strategy or restricted strategy for keeping these contexts in sequence on detection effectiveness, and the impact of partitioning context sequences by different granularities on scalability in time cost. The case study results indicate that using restricted context sequences sufficed to detect very high proportions of locking discipline violations detectable by using unrestricted context sequences, and the partitioning of context sets into finer equivalent classes significantly lowers the scalability in time cost with increasing number of threads to handle the same input workload.

关键词： Multithreaded program data race concurrency bug detection dynamic analysis case study

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：