International Journal of Innovative Research and Development

Abstract

In software testing, different testings are found. Software Testing using mutants is called as mutation testing. The impact of software testing on software maintenance is problematic and is of great weightage. So the need for identification of mutants different operator is necessary and this process is called u-java testing. Various techniques are proposed, that are quite efficient in providing   and finding mutants in different viewer .The approaches mainly followed for clone detection are comparison based on text and token based approach. These techniques take a huge amount of time and the process of comparison is very tedious and expensive. Moreover tree based techniques are very complex. The present study addresses a proposed approach which can be applied as byte code  to reduce the complexity encountered with the previous techniques .Test sets are designed in order to run mutants and  analyse uses byte code to calculate killed mutants. The reason of using byte code is that it is platform independent and represents the unified structure of the code. So the proposed approach also detected semantic mutants up to some extent. This approach can be used independently and it can be combined with other approaches to detect mutants

Keywords

Full Text

Abstract

Software testing is essential phase of Software development. Testing of software is a process which takes 50% time of total time needed to develop software product. To reduce the time & cost effort in testing by developing the test cases at earlier level of developing model based testing is one of the famed phenomena. In this paper we have compared different graphs used in model based testing on the basis of various criteria’s. Model dependency graph is one of most accurate and independent graph which tells the every relation, dependencies among the different modules of software. 

Keywords

Full Text