Optimal Divide and Query (extended version)

Computer Science – Software Engineering

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Algorithmic debugging is a semi-automatic debugging technique that allows the programmer to precisely identify the location of bugs without the need to inspect the source code. The technique has been successfully adapted to all paradigms and mature implementations have been released for languages such as Haskell, Prolog or Java. During three decades, the algorithm introduced by Shapiro and later improved by Hirunkitti has been thought optimal. In this paper we first show that this algorithm is not optimal, and moreover, in some situations it is unable to find all possible solutions, thus it is incomplete. Then, we present a new version of the algorithm that is proven optimal, and we introduce some equations that allow the algorithm to identify all optimal solutions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Optimal Divide and Query (extended version) 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 Optimal Divide and Query (extended version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Divide and Query (extended version) will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-175073

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.