Bug localization by algorithmic debugging and program slicing

  • Mariam Kamkar
  • Nahid Shahmehri
  • Peter Fritzson
Algorithmic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 456)

Abstract

This paper presents a generalized version of algorithmic debugging, a method for semi-automatic bug localization. The method is generally applicable to procedural languages, and is not dependent on any ad hoc assumptions regarding the subject program. The original form of algorithmic debugging, introduced by Shapiro [Shapiro-83], is however limited to small Prolog programs without side-effects. Another drawback of the original method is the large number of interactions with the user during bug localization.

To our knowledge, this work is the first generalization of algorithmic debugging for programs with side-effects written in imperative languages such as Pascal. Also, we have improved the search method in a way that eliminates many irrelevant questions to the programmer during bug localization. This makes it feasible to debug larger programs. The focusing of the localization process is achieved by using program slicing, a data flow analysis technique, to dynamically compute which parts of the program are relevant for the search. A prototype generalized algorithmic debugger for Pascal has been implemented in Pascal.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Drabent, et al-88]
    W. Drabent, S. Nadjm-Tehrani and J. Maluszynski: The Use of Assertions in Algorithmic Debugging. Proceeding of the FGCS conference, Tokyo, pages 573–581, 1988.Google Scholar
  2. [Ducasse, Emde-87]
    M. Ducasse and A. M. Emde: State of the Art in Automated Program Debugging. TR-LP-25, European Computer-Industry, Research Center GmbH, West Germany, September 1987.Google Scholar
  3. [Fritzson-83]
    P. Fritzson: Symbolic Debugging Through Incremental Compilation in an Integrated Environment. The Journal of Systems and Software 3, pages 285–294, 1983.Google Scholar
  4. [Horwitz, et al-88]
    Susan Horwitz, Thomas Reps and David Binkley: Interprocedural Slicing using Dependence Graphs. ACM Transactions on Programming Languages and Systems, Vol. 12, No. 1, pages 26–61, January 1990.Google Scholar
  5. [Kamkar, Shahmehri, Fritzson-88]
    M. Kamkar, N. Shahmehri and P. Fritzson: Affect-chaining and Dependency Oriented Flow Analysis Applied to Queries of Programs. Proceeding of the ACM symposium on Personal and Small Computers, Cannes, France, May 1988.Google Scholar
  6. [Lisper-89]
    B. Lisper: Single-Assignment Semantics for Imperative Programs. Lecture Notes in Computer Science, No. 366 PARLE'89, Vol. II, pages 321–334.Google Scholar
  7. [Lyle-84]
    James R. Lyle: Evaluating Variations on Program Slicing for Debugging. Ph.D Dissertation, Computer Science Dept. University of Maryland, Dec 1984.Google Scholar
  8. [Lyle, Weiser-87]
    James R. Lyle and Mark Weiser: Automatic Program Bug Location by Program Slicing. In 2:nd IEEE Symp. on Computers and Applications, Peking, pages 877–883, June 1987.Google Scholar
  9. [Seviora-87]
    Rudolph E. Seviora: Knowledge-Based Program Debugging Systems, IEEE Software, Vol. 4 No. 3, May 1987.Google Scholar
  10. [Shahmehri, Fritzson-89]
    Nahid Shahmehri and Peter Fritzson: Algorithmic Debugging for Imperative Languages with Side-effects, LiTH-IDA-R-89-49, Department of Computer and Information Science, Linköping University, Sweden, November 1989.Google Scholar
  11. [Shapiro-83]
    E. Y. Shapiro: Algorithmic Program Debugging. MIT press. 1983.Google Scholar
  12. [Weiser-84]
    Mark Weiser: Program Slicing. IEEE Transactions on Software Engineering, Vol. Se-10, No. 4, pages 352–357, July 1984.Google Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Mariam Kamkar
    • 1
  • Nahid Shahmehri
    • 1
  • Peter Fritzson
    • 1
  1. 1.Department of Computer and Information ScienceLinköping UniversityLinköpingSweden

Personalised recommendations