Detection of linear errors via domain testing
ACM Transactions on Software Engineering and Methodology (TOSEM)
| Hi-index | 0.00 |
DOMAIN TESTING IS AN APPROACH TO SOFTWARE TESTING THAT ATTEMPTS TO FIND ERRORS ON THE FLOW OF CONTROL THROUGH A PROGRAM. THREE FORMS OF DOMAIN TESTING HAVE BEEN PROPOSED, ALL DEALING WITH THE DETECTION OF LINEAR ERRORS IN LINEAR FUNCTIONS. THIS PAPER EXAMINES THE COMPETING FORMS OF DOMAIN TESTING USING PERTURBATION ANALYSIS, A TECHNIQUE FOR MEASURING THE ERROR DETECTION CAPACITY OF A SET OF TEST DATA. THE DIFFERENT FORMS OF DOMAIN TESTING ARE SHOWN TO BE CLOSER IN ERROR DETECTION ABILITY THAN HAD BEEN SUPPOSED AND MAY ALL BE CONSIDERED EFFECTIVE FOR FINDING LINEAR ERRORS IN LINEAR PREDICATE FUNCTIONS. A SIMPLE EXTENSION IS PROPOSED WHICH ALLOWS THEM TO DETECT LINEAR ERRORS IN NON-LINEAR PREDICATE FUNCTIONS, AT LITTLE ADDITIONAL COST. A NEW ALGORITHM IS PROPOSED THAT SHIFTS THE EMPHASIS FROM LINEAR ERRORS TO LINEAR FAULTS, THEREBY ALLOWING DOMAIN TESTING TO TAKE INTO ACCOUNT THE INTERACTION AMONG TESTS FOR DIFFERENT PATHS.