A novel bipartite graph approach for selection and prioritisation of test cases

Authors:
Deepak Garg;Amitava Datta;Tim French
Affiliations:
The University of Western Australia, Perth, Australia;The University of Western Australia, Perth, Australia;The University of Western Australia, Perth, Australia
Venue:
ACM SIGSOFT Software Engineering Notes
Year:
2013

Citing 10
Cited 0

Analyzing Regression Test Selection Techniques

IEEE Transactions on Software Engineering
Regression test selection for Java software

OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Prioritizing Test Cases For Regression Testing

IEEE Transactions on Software Engineering
Prioritizing User-Session-Based Test Cases for Web Applications Testing

ICST '08 Proceedings of the 2008 International Conference on Software Testing, Verification, and Validation
A n5/2 algorithm for maximum matchings in bipartite

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
A Novel Approach to Automatic Test Case Generation for Web Applications

QSIC '10 Proceedings of the 2010 10th International Conference on Quality Software
Prioritizing tests for software fault diagnosis

Software—Practice & Experience
Automated Test Case Generation for Web Applications from a Domain Specific Model

COMPSACW '11 Proceedings of the 2011 IEEE 35th Annual Computer Software and Applications Conference Workshops
Prioritization of Test Cases Using Software Agents and Fuzzy Logic

ICST '12 Proceedings of the 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation
Using Dependency Structures for Prioritization of Functional Test Suites

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Every regression testing cycle of a software application results in new test cases being introduced in a test suite. Many test cases from previous regression testing cycles become unstable or unusable due to the removal/addition of the new functionalities. The execution of a large number of unusable test cases results in less test coverage and higher test execution time. The lower test coverage is due to the coverage of the non-existent code statements. The higher test execution time is due to the execution of unused and broken test cases. In this paper, we propose a new bipartite graph approach to eliminate the subset of test cases that are not relevant for the testing of the current version of a software application. The suggested approach helps in executing a minimal set of test cases that are required to cover more code statements.