A mathematical framework for automated bug localization
Software Engineering
2007-05-23 v1
Abstract
In this paper, we propose a mathematical framework for automated bug localization. This framework can be briefly summarized as follows. A program execution can be represented as a rooted acyclic directed graph. We define an execution snapshot by a cut-set on the graph. A program state can be regarded as a conjunction of labels on edges in a cut-set. Then we argue that a debugging task is a pruning process of the execution graph by using cut-sets. A pruning algorithm, i.e., a debugging task, is also presented.
Cite
@article{arxiv.cs/0309055,
title = {A mathematical framework for automated bug localization},
author = {Tsuyoshi Ohta and Tadanori Mizuno},
journal= {arXiv preprint arXiv:cs/0309055},
year = {2007}
}
Comments
4 pages, 2 figures, In M. Ronsse, K. De Bosschere (eds), proceedings of the Fifth International Workshop on Automated Debugging (AADEBUG 2003), September 2003, Ghent. cs.SE/0309027