Test Case Reduction based upon Path Coverage Criteria
Author(s) -
Monika Grover,
Pradeep Kumar
Publication year - 2017
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2017915100
Subject(s) - computer science , reduction (mathematics) , test (biology) , path (computing) , operations research , computer network , mathematics , geology , paleontology , geometry
The cost of commercial software systems is usually over budget and within limited time duration. Most critical and time consuming phase of a software development process is effort estimation and 50% of this phase is often devoted to testing effort estimation. If we can find a way to reduce effort estimation, then it will greatly deduct total cost and effort needed to be spent in software development. Researchers have been continuously trying to find new ways to reduce effort estimation and improving methods which have been devised already. This paper proposes to use path-oriented test case generation and their reduction with reference to different priorities such as complexity, impact, path coverage etc. We are using different examples to reduce the test cases using various factors i.e. Test case Complexity, its impact and the path coverage.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom