Jump to content

Bisection (software engineering)

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Hdu hh (talk | contribs) at 09:29, 4 June 2012 (Reference Topological_ordering and Search_space). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Code Bisection is a method used in software development to identify change sets that result in a specific behavior change. It is mostly employed for finding the patch that introduced a bug. Another application area is finding the patch that indirectly fixed a bug.

Overview

The code bisection method depends on the having access to the code history which is usually preserved by revision control in a code repository.

The Bisection Method

Since code history has the structure of an acyclic directed graph which has the topological ordering properties it is possible split up a search space, test for the behavior in question and depending on the result reducing the search space further for the next iteration step.

For code bisection it is desirable that each revision in the search space can be compiled and tested independently.

Support by Revision Control Systems

Some revision control systems like Git or Mercurial directly support [1][2] the code bisection method.

References

  1. ^ http://www.kernel.org/pub/software/scm/git/docs/v1.7.10/git-bisect.html
  2. ^ http://www.selenic.com/mercurial/hg.1.html#bisect
Retrieved from "https://en.wikipedia.org/w/index.php?title=Bisection_(software_engineering)&oldid=495905840"