The number of tests required for branch coverage

This article addesses the number of test cases needed to achieve branch coverage and introduces a new bound called b..., which is calculated upon the program control flow structure. We believe that b... sers a meaningful lower bound to the number of rests that should be planned to achieve branch coverage. A comparison is made whit the cyclomatic complexity of the program's control flow (best known as McCabe's number), which is often used for the same purpose, including the results of a case study conduced within a real-world testing environment.