Jump to content

Basis path testing

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 188.27.81.64 (talk) at 00:33, 18 July 2014 (I can find it in dozens of books, so it's obviously notable. Also I fixed the many wrongs things in this crappy stub. A summary of the fixes doesn't even fit in this summary box.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In software engineering, basis path testing, or structured testing, is a white box method for designing test cases. The method analyzes the control flow graph of a program to find a set of linearly independent paths of execution. The method normally uses McCabe' cyclomatic complexity to determine the number of linearly independent paths and then generates test cases for each path.[1] The method guarantees complete code coverage, but achieves that without covering all possible paths.[2] The method has been widely used and studied.[3]

References

  1. ^ Linda Westfall (2008). The Certified Software Quality Engineer Handbook. ASQ Quality Press. pp. 436โ€“437. ISBN 978-0-87389-730-3.
  2. ^ Y.N. Srikant; Priti Shankar (2002). The Compiler Design Handbook: Optimizations and Machine Code Generation. CRC Press. p. 249. ISBN 978-1-4200-4057-9.
  3. ^ Robert V. Binder (2000). Testing Object-oriented Systems: Models, Patterns, and Tools. Addison-Wesley Professional. p. 378. ISBN 978-0-201-80938-1.