Bug localization by algorithmic debugging and program slicing
- Mariam KamkarAffiliated withDepartment of Computer and Information Science, Linköping University
- , Nahid ShahmehriAffiliated withDepartment of Computer and Information Science, Linköping University
- , Peter FritzsonAffiliated withDepartment of Computer and Information Science, Linköping University
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.
- Bug localization by algorithmic debugging and program slicing
- Book Title
- Programming Language Implementation and Logic Programming
- Book Subtitle
- International Workshop PLILP '90 Linköping, Sweden, August 20–22, 1990 Proceedings
- pp 60-74
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
To view the rest of this content please follow the download PDF link above.