Confirmation of deadlock potentials detected by runtime analysis

  • Authors:

  • Saddek Bensalem;Jean-Claude Fernandez;Klaus Havelund;Laurent Mounier

  • Affiliations:

  • Verimag, Gieres, France;Verimag, Gieres, France;Kestrel Technology, Los Altos, California;Verimag, Gieres, France

  • Venue:
  • Proceedings of the 2006 workshop on Parallel and distributed systems: testing and debugging
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a framework for confirming deadlock potentials detected by runtime analysis of a single run of a multi-threaded program. The multi-threaded program under examination is instrumented to emit lock and unlock events. When the instrumented program is executed, a trace is generated consisting of the lock and unlock operations performed during that specific run. A lock graph is constructed which can reveal deadlock potentials in the form of cycles. The effectiveness of this analysis is caused by the fact that successful non-deadlocking runs yield as good, and normally better, information as deadlocking runs. Each cycle is then used to construct an observer that can detect the occurrence of the corresponding real deadlock, should it occur during subsequent test runs; and a controller, which, when composed with the program, determines the optimal scheduling strategy that will maximize the probability for the corresponding real deadlock to occur. The framework is formalized in terms of transition systems and is implemented in Java.