Abstract-Regression testing assures changed programs against unintended amendments. Rearranging the execution order of test cases is a key idea to improve their effectiveness. Paradoxically, many test case prioritization techniques resolve tie cases using the random selection approach, and yet random ordering of test cases has been considered as ineffective. Existing unit testing research unveils that adaptive random testing (ART) is a promising candidate that may replace random testing (RT). In this paper, we not only propose a new family of coverage-based ART techniques, but also show empirically that they are statistically superior to the RT-based technique in detecting faults. Furthermore, one of the ART prioritization techniques is consistently comparable to some of the best coverage-based prioritization techniques (namely, the "additional" techniques) and yet involves much less time cost.

Random testing is not only a useful testing technique in itself, but also plays a core role in many other testing methods. Hence, any significant improvement to random testing has an impact throughout the software testing community. Recently, Adaptive Random Testing (ART) was proposed as an effective alternative to random testing. This paper presents a synthesis of the most important research results related to ART. In the course of our research and through further reflection, we have realised how the techniques and concepts of ART can be applied in a much broader context, which we present here. We believe such ideas can be applied in a variety of areas of software testing, and even beyond software testing. Amongst these ideas, we particularly note the fundamental role of diversity in test case selection strategies. We hope this paper serves to provoke further discussions and investigations of these ideas.

No abstract

Service-oriented applications use XPath extensively to integrate loosely-coupled workflow steps. A mismatch among components (e.g., extracting the wrong contents or failing to extract any content from a correct XML message) may cause an application to function incorrectly. XPath should be studied deeply to improve the quality of the applications. In the development of the web services, XPath play a crucial role to capture the messages. Sometimes, XPath can extract error messages, so if XPath can be combined with mutation analysis, the error messages can be avoided. The mutation analysis helps to develop effective tests or locate weaknesses in the test data used for the program or in sections of the code. The time taken to find the error messages and to remove them is critical in the context of XPath. Data flow testing will be done on the test cases generated by the XPath. The effectiveness of the application can be measured by using the fault detection rate. In this paper a technique called the mutation analysis with the use of finite state machine was used to find the mismatch among the components. This approach can be implemented for open source applications. The fault detection rate and the time taken to find the mismatches occured are used to evaluate the approach. We will evaluate this approach by performing the dataflow testing on the open source applications until all the errors in the XML messages are found.

There are two fundamental limitations in software testing, known as the reliable test set problem and the oracle problem. Fault-based testing is an attempt by Morell to alleviate the reliable test set problem. In this paper, we propose to enhance fault-based testing to alleviate the oracle problem as well. We present an integrated method that combines metamorphic testing with fault-based testing using real and symbolic inputs.