7 - Debugging Strategies

• Published in: Debugging by Thinking pp. 189 - 199
• Main Author: Robert Charles Metzger
• Format: Book Chapter
• Language: English
• Published: Elsevier Inc 2003
• ISBN: 1555583075; 9781555583071
• DOI: 10.1016/B978-155558307-1/50007-0

This chapter presents the definitions of debugging strategies. These strategies are defined in terms of their assumptions and control structure. The chapter explains the evaluation criteria that can be used to determine whether a given strategy is leading to progress in diagnosing a defect. It also explains how to choose among the various strategies presented. Every debugging strategy consists of three parts: a set of assumptions, a control structure, and an evaluation mechanism. The purpose of the evaluation mechanism is to tell whether he/she is making progress. The binary search strategy is analogous to the binary search algorithm taught in every beginner's data structures or algorithms class. This strategy assumes that the code segments under investigation have some linear ordering. The greedy search strategy is analogous to the greedy method taught in introductory algorithms classes. This strategy assumes that the program is divisible into segments that can be tested for responsibility for the defect. The key to the greedy search strategy is finding a selection method that maximizes the benefit and minimizes the cost for each iteration of the strategy.