Identification of Potential Reusable Subroutines in Recorded Automated Test Scripts
Authors:
- 1 January 2018
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 28 (01) , 3-36
Abstract
In the automated testing based on actions in user interface of the tested application, one of the key challenges is maintenance of these tests. The maintenance overhead can be decreased by suitably structuring the test scripts, typically by employing reusable objects. To aid in the development, maintenance and refactoring of these test scripts, potentially reusable objects can be identified by a semi-automated process. In this paper, we propose a solution that identifies the potentially reusable objects in a set of automated test scripts and then provides developers with suggestions about these objects. During this process, we analyze the semantics of specific test steps using a system of abstract signatures. The solution can be used to identify the potentially reusable objects in both recorded automated test sets and tests programmed in an unstructured style. Moreover, compared to approaches that are based solely on searching for repetitive source code fragments, the proposed system identifies potentially reusable objects that are more relevant for test automation.Keywords
This publication has 12 references indexed in Scilit:
- A Comparative Study on Code Smell Detection ToolsInternational Journal of Advanced Science and Technology, 2013
- BlackHorse: creating smart test cases from brittle recorded testsSoftware Quality Journal, 2013
- A method of minimum reusability estimation for automated software testingJournal of Shanghai Jiaotong University (Science), 2013
- Automated Transition from Use Cases to UML State Machines to Support State-Based Testing2011
- Automating regression testing using web-based application similaritiesInternational Journal on Software Tools for Technology Transfer, 2010
- An Object-Oriented Framework for Improving Software Reuse on Automated Testing of Mobile PhonesLecture Notes in Computer Science, 2007
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974