Basis path testing

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 (all CFG edges), but achieves that without covering all possible paths.^[2] The method has been widely used and studied.^[3]

References

^ Linda Westfall (2008). The Certified Software Quality Engineer Handbook. ASQ Quality Press. pp. 436–437. ISBN 978-0-87389-730-3.
^ 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.
^ Robert V. Binder (2000). Testing Object-oriented Systems: Models, Patterns, and Tools. Addison-Wesley Professional. p. 378. ISBN 978-0-201-80938-1.

External links

What is Basis Path Testing? from the National Institute for Science and Technology

This software-engineering-related article is a stub. You can help Wikipedia by expanding it.

[Westfall2008-1] Linda Westfall (2008). The Certified Software Quality Engineer Handbook. ASQ Quality Press. pp. 436–437. ISBN 978-0-87389-730-3.

[SrikantShankar2002-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.

[Binder2000-3] Robert V. Binder (2000). Testing Object-oriented Systems: Models, Patterns, and Tools. Addison-Wesley Professional. p. 378. ISBN 978-0-201-80938-1.

[1]

[2]

[3]