By Topic

On the Use of Constraints in Dynamic Slicing for Program Debugging

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Franz Wotawa ; Inst. for Software Technol., Tech. Univ. Graz, Graz, Austria

During the past decades research in automated debugging has led to several approaches. Some of them are based on structural and some of them on behavioral characteristics of the source code. The quality of the obtained results in terms of computed fault candidates compared to the overall number of statement usually is better when considering the program's behavior or even more sophisticated models representing the structure and the semantics of the program. However, for larger programs such approaches are not feasible and more light-weighted techniques have to be used in order to keep running time as small as possible. In this paper, we introduce an approach that combines dynamic slicing with constraint computation in order to increase the debugging quality while retaining small computational footprint. Using the presented approach it was possible to remove all fault candidates except the correct root cause for a particular program.

Published in:

Software Testing, Verification and Validation Workshops (ICSTW), 2011 IEEE Fourth International Conference on

Date of Conference:

21-25 March 2011