Isolating bugs in multithreaded programs using execution suppression

  • Authors:
  • Dennis Jeffrey;Yan Wang;Chen Tian;Rajiv Gupta

  • Affiliations:
  • The University of California at Riverside, CSE Department, Riverside, CA 92521, U.S.A.;The University of California at Riverside, CSE Department, Riverside, CA 92521, U.S.A.;The University of California at Riverside, CSE Department, Riverside, CA 92521, U.S.A.;The University of California at Riverside, CSE Department, Riverside, CA 92521, U.S.A.

  • Venue:
  • Software—Practice & Experience
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Memory-related program failures in multithreaded programs can be caused by a variety of bugs. Concurrency bugs can occur due to unexpected or incorrect thread interleavings during execution. Other kinds of memory bugs, such as buffer overflows and uninitialized reads, may also occur in multithreaded as well as single-threaded programs. Most prior techniques for isolating these bugs are specialized, addressing only one type of concurrency bug or certain types of other memory bugs. The memory corruption caused by these bugs can also undergo significant propagation during program execution. When a program failure finally occurs due to memory corruption, the true root cause of the failure may be effectively concealed as significant portions of memory may have become corrupted. We propose a general framework that can isolate the root cause of any failure in a multithreaded program that involves memory corruption and reveals at least a subset of this memory corruption. This includes three important types of concurrency bugs—data races, atomicity violations, and order violations—as well as other kinds of memory bugs. To account for propagation of memory corruption, our approach uses a dynamic technique called ‘execution suppression’ that iteratively reveals memory corruption in a failing execution to isolate the true root cause of the failure. Copyright © 2011 John Wiley & Sons, Ltd.