A mathematical framework for automated bug localization
| dc.creator | Ohta, Tsuyoshi | |
| dc.creator | Mizuno, Tadanori | |
| dc.date | 2003-09-30 | |
| dc.date.accessioned | 2026-07-07T03:20:23Z | |
| dc.date.available | 2026-07-07T03:20:23Z | |
| dc.description | 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. | |
| dc.description | 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 | |
| dc.identifier | https://arxiv.org/abs/cs/0309055 | |
| dc.identifier | http://arxiv.org/abs/cs/0309055 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31807 | |
| dc.subject | Software Engineering | |
| dc.subject | D.2.5 | |
| dc.title | A mathematical framework for automated bug localization | |
| dc.type | text |