Boundary-value analysis is a software testing technique in which tests are designed to include representatives of boundary values in a range. The idea comes from the boundary. Given that we have a set of test vectors to test the system, a topology can be defined on that set. 

• If input is a range of values between A – B, then design test case for A, A+1, A-1 and B, B+1, B – 1.

  Thus, a number of bugs can be found when applying BVA because developer tends to commit mistakes in this area when writing code.

  If ( Amount < = 100 )

  {

  Throw error

  }

  If ( Amount > = 5000 )

  {

  …..

  }

  If „equals‟ is there, then even 100 value is expected.

  When comparing Equivalence Partitioning and BVA, testing values are repeated – if that is the case, we can neglect Equivalence Partitioning and perform only BVA as it covers all the values.