A branch-and-bound algorithm for checking Hurwitz and Schur stability of symmetric interval matrices is proposed. The algorithm in a finite number of steps either verifies stability or finds a symmetric matrix which is not stable. It can also be used for checking positive definiteness of nonsymmetric interval matrices.