.png){kind=icon}
Return
Effective program debugging based on execution slices and inter-block data dependency
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2005.06.045.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Localizing a fault in program debugging is a complex and time-consuming process. In this paper we present a novel approach using execution slices and inter-block data dependency to effectively identify the locations of program faults. An execution slice with respect to a given test case is the set of code executed by this test, and two blocks are data dependent if one block contains a definition that is used by another block or vice versa. Not only can our approach reduce the search domain for program debugging, but also prioritize suspicious locations in the reduced domain based on their likelihood of containing faults. More specifically, we use multiple execution slices to prioritize the likelihood of a piece of code containing a specific fault. In addition, the likelihood also depends oil whether this piece of code is data dependent on other suspicious code. A debugging tool, DESiD, was developed to support our method. A case study that shows the effectiveness of our method in locating faults on an application developed for the European Space Agency is also reported. (c) 2005 Elsevier Inc. All rights reserved.
Keywords:
software testing
fault localization
program debugging
execution slice
inter-block data dependency
DESiD
Journal
IF:
4.1
Papers:
5.5K
Citations:
8.4K
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSave
ShareSaveShareSaveGABAergic neurons in prepositus hypoglossi regulate REM sleep by its action on locus coeruleus in freely moving rats.png)
Synapse
SynapseIF0
PREAI
ShareSaveShareSave no more
no more