A mathematical framework for automated bug localization

Details A mathematical framework for automated bug localization A mathematical framework for automated bug localization

2003-09-30

arxiv.org/abs/cs/0309055v1

Computer Science

Software Engineering

4 pages, 2 figures, In M. Ronsse, K. De Bosschere (eds), proceedings of the Fifth International Workshop on Automated Debuggin

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A mathematical framework for automated bug localization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A mathematical framework for automated bug localization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A mathematical framework for automated bug localization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-279900