A mathematical framework for automated bug localization
<|reference_start|>A mathematical framework for automated bug localization: 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.<|reference_end|>
@article{ohta2003a,
    title={A mathematical framework for automated bug localization},
    author={Tsuyoshi Ohta, Tadanori Mizuno (Shizuoka University)},
    journal={arXiv preprint arXiv:cs/0309055},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0309055},
    primaryClass={cs.SE}
}