scholarly journals Analyzing multicore dumps to facilitate concurrency bug reproduction

2010 ◽  
Author(s):  
Dasarath Weeratunge ◽  
Xiangyu Zhang ◽  
Suresh Jagannathan
Keyword(s):  
Concurrency Bug

scholarly journals Multicore acceleration of priority-based schedulers for concurrency bug detection

2012 ◽  
Vol 47 (6) ◽  
pp. 543-554 ◽  
Author(s):  
Santosh Nagarakatte ◽  
Sebastian Burckhardt ◽  
Milo M.K. Martin ◽  
Madanlal Musuvathi
Keyword(s):  
Bug Detection ◽  
Concurrency Bug Detection ◽  
Multicore Acceleration ◽  
Concurrency Bug

scholarly journals Efficient concurrency-bug detection across inputs

2013 ◽  
Vol 48 (10) ◽  
pp. 785-802 ◽  
Author(s):  
Dongdong Deng ◽  
Wei Zhang ◽  
Shan Lu
Keyword(s):  
Bug Detection ◽  
Concurrency Bug Detection ◽  
Concurrency Bug

scholarly journals Concurrency Bug Avoiding Based on Optimized Software Transactional Memory

2019 ◽  
Vol 2019 ◽  
pp. 1-19
Author(s):  
Z. Yu ◽  
Y. Zuo ◽  
W. C. Xiong
Keyword(s):  
Transactional Memory ◽  
File Systems ◽  
Software Transactional Memory ◽  
Concurrency Bugs ◽  
Multithreaded Programs ◽  
In The Wild ◽  
Human Cost ◽  
Data Races ◽  
Virtual File Systems ◽  
Concurrency Bug

Software transactional memory is an effective mechanism to avoid concurrency bugs in multithreaded programs. However, two problems hinder the adoption of such traditional systems in the wild world: high human cost for equipping programs with transaction functionality and low compatibility with I/O calls and conditional variables. This paper presents Convoider to solve these problems. By intercepting interthread operations and designating code among them as transactions in each thread, Convoider automatically transactionalizes target programs without any source code modification and recompiling. By saving/restoring stack frames and CPU registers on beginning/aborting a transaction, Convoider makes execution flow revocable. By turning threads into processes, leveraging virtual memory protection and customizing memory allocation/deallocation, Convoider makes memory manipulations revocable. By maintaining virtual file systems and redirecting I/O operations onto them, Convoider makes I/O effects revocable. By converting lock/unlock operations to no-ops, customizing signal/wait operations on condition variables, and committing memory changes transactionally, Convoider makes deadlocks, data races, and atomicity violations impossible. Experimental results show that Convoider succeeds in transparently transactionalizing twelve real-world applications with averagely incurring only 28% runtime overhead and perfectly avoid 94% of thirty-one concurrency bugs used in our experiments. This study can help efficiently transactionalize legacy multithreaded applications and effectively improve the runtime reliability of them.

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

2017 ◽  
Vol 26 (3) ◽  
pp. 855-889 ◽  
Author(s):  
Haojie Fu ◽  
Zan Wang ◽  
Xiang Chen ◽  
Xiangyu Fan
Keyword(s):  
Bug Detection ◽  
Systematic Survey ◽  
Concurrency Bug Detection ◽  
Concurrency Bug

scholarly journals Debugging Nondeterministic Failures in Linux Programs through Replay Analysis

2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Shakaiba Majeed ◽  
Minsoo Ryu
Keyword(s):  
Real World ◽  
Production Systems ◽  
Memory Access ◽  
Analysis Method ◽  
Concurrency Bugs ◽  
Real World Applications ◽  
Record And Replay ◽  
Access Patterns ◽  
Event Based ◽  
Concurrency Bug

Reproducing a failure is the first and most important step in debugging because it enables us to understand the failure and track down its source. However, many programs are susceptible to nondeterministic failures that are hard to reproduce, which makes debugging extremely difficult. We first address the reproducibility problem by proposing an OS-level replay system for a uniprocessor environment that can capture and replay nondeterministic events needed to reproduce a failure in Linux interactive and event-based programs. We then present an analysis method, called replay analysis, based on the proposed record and replay system to diagnose concurrency bugs in such programs. The replay analysis method uses a combination of static analysis, dynamic tracing during replay, and delta debugging to identify failure-inducing memory access patterns that lead to concurrency failure. The experimental results show that the presented record and replay system has low-recording overhead and hence can be safely used in production systems to catch rarely occurring bugs. We also present few concurrency bug case studies from real-world applications to prove the effectiveness of the proposed bug diagnosis framework.

scholarly journals Applying Transactional Memory for Concurrency-Bug Failure Recovery in Production Runs

2019 ◽  
Vol 30 (5) ◽  
pp. 990-1006
Author(s):  
Yuxi Chen ◽  
Shu Wang ◽  
Shan Lu ◽  
Karthikeyan Sankaralingam
Keyword(s):  
Transactional Memory ◽  
Failure Recovery ◽  
Concurrency Bug

Collaborative Technique for Concurrency Bug Detection

2014 ◽  
Vol 43 (2) ◽  
pp. 260-285 ◽  
Author(s):  
Zhendong Wu ◽  
Kai Lu ◽  
Xiaoping Wang ◽  
Xu Zhou
Keyword(s):  
Bug Detection ◽  
Concurrency Bug Detection ◽  
Concurrency Bug

Concurrency bug localization using shared memory access pairs

2014 ◽  
Vol 49 (8) ◽  
pp. 375-376
Author(s):  
Wenwen Wang ◽  
Chenggang Wu ◽  
Pen-Chung Yew ◽  
Xiang Yuan ◽  
Zhenjiang Wang ◽  
...  
Keyword(s):  
Shared Memory ◽  
Memory Access ◽  
Bug Localization ◽  
Concurrency Bug

Effective pattern-driven concurrency bug detection for operating systems

2013 ◽  
Vol 86 (2) ◽  
pp. 377-388 ◽  
Author(s):  
Shin Hong ◽  
Moonzoo Kim
Keyword(s):  
Operating Systems ◽  
Bug Detection ◽  
Concurrency Bug Detection ◽  
Concurrency Bug
Sign in / Sign up

Export Citation Format

Share Document