Search for Prioritized Test Cases during Web Application Testing

2019 ◽  
Vol 10 (2) ◽  
pp. 1-26 ◽  
Author(s):  
Munish Khanna ◽  
Naresh Chauhan ◽  
Dilip Kumar Sharma
Keyword(s):  
Web Application ◽  
Web Applications ◽  
Greedy Algorithms ◽  
Regression Testing ◽  
Test Sequence ◽  
Test Case ◽  
Test Cases ◽  
Average Percentage ◽  
Heuristic Approaches ◽  
Better Than

Regression testing of evolving software is a critical constituent of the software development process. Due to resources constraints, test case prioritization is one of the strategies followed in regression testing during which a test case that satisfies predefined objectives the most, as the tester perceives, would be executed the earliest. In this study, all the experiments were performed on three web applications consisting of 65 to 100 pages with lines of code ranging from 5000 to 7000. Various state-of-the-art approaches such as, heuristic approaches, Greedy approaches, and meta heuristic approaches were applied so as to identify the prioritized test sequence which maximizes the value of average percentage of fault detection. Performance of these algorithms was compared using different parameters and it was concluded that the Artificial Bee Colony algorithm performs better than all. Two novel greedy algorithms are also proposed in the study, of which the goal is to smartly manage the state of a tie, where a tie exhibits the condition that all the test cases participating in the tie are of equal significance in achieving the objective. It has also been validated that the performance of these novel proposed algorithm(s) is better than that of traditionally followed greedy approach, most of the time.

Image-Based Approach to Determining Regression Test Results of Dynamic Web Applications

2018 ◽  
Vol 28 (07) ◽  
pp. 1001-1025 ◽  
Author(s):  
Akihiro Hori ◽  
Shingo Takada ◽  
Toshiyuki Kurabayashi ◽  
Haruto Tanno
Keyword(s):  
Web Application ◽  
Web Applications ◽  
Regression Testing ◽  
Test Case ◽  
Test Cases ◽  
Test Results ◽  
Test Execution ◽  
Dynamic Web ◽  
Regression Test ◽  
Post Modification

Much work has been done on automating regression testing for applications. But most of them focus on test execution. Little work has been done on automatically determining if a test case passes or fails. This decision is often made by comparing the results of executing test cases on a base version of the application and post-modification version of the application. If the two results match, the test case passes, otherwise fails. However, to the best of our knowledge, there is no regression testing method for automatically deciding pass/fail of dynamic Web applications which use JavaScript or CSS. We propose a method that automatically decides if a dynamic Web application passes a regression test case. The basic idea is to obtain a screenshot each time the GUI of the Web application (i.e. Web page) changes its state, and then compare each corresponding screenshot to see if they match. The evaluation results showed that the accuracy rate of our approach is high and our approach can be considered as fast enough for practical use.

scholarly journals Bi-Objective Constraint and Hybrid Optimizer for the Test Case Prioritization

2019 ◽  
Vol 8 (6) ◽  
pp. 3436-3448
Keyword(s):  
Taylor Series ◽  
Optimization Algorithm ◽  
Fitness Function ◽  
Regression Testing ◽  
Test Case ◽  
Test Cases ◽  
Test Case Prioritization ◽  
Optimal Test ◽  
Average Percentage ◽  
Branch Coverage

Regression testing is performed to make conformity that any changes in software program do not disturb the existing characteristics of the software. As the software improves, the test case tends to grow in size that makes it very costly to be executed, and thus the test cases are needed to be prioritized to select the effective test cases for software testing. In this paper, a test case prioritization technique in regression testing is proposed using a novel optimization algorithm known as Taylor series-based Jaya Optimization Algorithm (Taylor-JOA), which is the integration of Taylor series in Jaya Optimization Algorithm (JOA). The optimal test cases are selected based on the fitness function, modelled depending on the constraints, namely fault detection and branch coverage. The experimentation of the proposed Taylor-JOA is performed with the consideration of the evaluation metrics, namely Average Percentage of Fault Detected (APFD) and the Average Percentage of Branch Coverage (APBC). The APFD and the APBC of the proposed Taylor-JOA is 0.995, and 0.9917, respectively, which is high as compared to the existing methods that show the effectiveness of the proposed Taylor-JOA in the task of test case prioritization

FlakyLoc: Flakiness Localization for Reliable Test Suites in Web Applications

2020 ◽  
Author(s):  
Jesús Morán ◽  
Cristian Augusto ◽  
Antonia Bertolino ◽  
Claudio De La Riva ◽  
Javier Tuya
Keyword(s):  
Environmental Factors ◽  
Web Application ◽  
Web Applications ◽  
Test Case ◽  
Test Cases ◽  
Root Cause ◽  
Test Execution ◽  
Fine Grain ◽  
Asynchronous Communications

Web application testing is a great challenge due to the management of complex asynchronous communications, the concurrency between the clients-servers, and the heterogeneity of resources employed. It is difficult to ensure that a test case is re-running in the same conditions because it can be executed in undesirable ways according to several environmental factors that are not easy to fine-grain control such as network bottlenecks, memory issues or screen resolution. These environmental factors can cause flakiness, which occurs when the same test case sometimes obtains one test outcome and other times another outcome in the same application due to the execution of environmental factors. The tester usually stops relying on flaky test cases because their outcome varies during the re-executions. To fix and reduce the flakiness it is very important to locate and understand which environmental factors cause the flakiness. This paper is focused on the localization of the root cause of flakiness in web applications based on the characterization of the different environmental factors that are not controlled during testing. The root cause of flakiness is located by means of spectrum-based localization techniques that analyse the test execution under different combinations of the environmental factors that can trigger the flakiness. This technique is evaluated with an educational web platform called FullTeaching. As a result, our technique was able to locate automatically the root cause of flakiness and provide enough information to both understand it and fix it.

scholarly journals Efficiency Enhancement in Regression Test Case Prioritization Technique

2019 ◽  
Vol 8 (12) ◽  
pp. 5445-5451
Keyword(s):  
Fault Detection ◽  
Software Quality ◽  
Detection Rate ◽  
Regression Testing ◽  
Test Case ◽  
Test Cases ◽  
Efficiency Enhancement ◽  
Average Percentage ◽  
Regression Test ◽  
Expensive Process

Regression testing is an important, but expensive, process that has a powerful impact on software quality. Unfortunately all the test cases, existing and newly added, cannot be re-executed due to insufficient resources. In this scenario, prioritization of test case helps in improving the efficacy of regression testing by arranging the test cases in such a way that the most beneficial (that has the potential to detect the more number of faults) are executed first. Previous work and existing prioritization techniques, though detects faults, but there is a need of improved techniques to enhance the process of regression testing by improving the fault detection rate. The new technique, proposed in this paper, gives improved result than the existing ones. The comparison of the effectiveness of the proposed approach is done with other prioritization and non-prioritization orderings. The result of the proposed approach shows higher average percentage of faults detected (APFD) values. Also, the performance is evaluated and it is observed that the capability of the proposed method outperforms other algorithms by enhancing the fault detection rate.

scholarly journals K-Step Crossover Method based on Genetic Algorithm for Test Suite Prioritization in Regression Testing

2021 ◽  
Vol 27 (2) ◽  
pp. 170-189
Author(s):  
P. K. Gupta
Keyword(s):  
Genetic Algorithm ◽  
Regression Testing ◽  
Test Suite ◽  
Test Case ◽  
Test Cases ◽  
Test Case Prioritization ◽  
Average Percentage ◽  
Code Coverage ◽  
Test Case Selection ◽  
Case Selection

Software is an integration of numerous programming modules  (e.g., functions, procedures, legacy system, reusable components, etc.) tested and combined to build the entire module. However, some undesired faults may occur due to a change in modules while performing validation and verification. Retesting of entire software is a costly affair in terms of money and time. Therefore, to avoid retesting of entire software, regression testing is performed. In regression testing, an earlier created test suite is used to retest the software system's modified module. Regression Testing works in three manners; minimizing test cases, selecting test cases, and prioritizing test cases. In this paper, a two-phase algorithm has been proposed that considers test case selection and test case prioritization technique for performing regression testing on several modules ranging from a smaller line of codes to huge line codes of procedural language. A textual based differencing algorithm has been implemented for test case selection. Program statements modified between two modules are used for textual differencing and utilized to identify test cases that affect modified program statements. In the next step, test case prioritization is implemented by applying the Genetic Algorithm for code/condition coverage. Genetic operators: Crossover and Mutation have been applied over the initial population (i.e. test cases), taking code/condition coverage as fitness criterion to provide a prioritized test suite. Prioritization algorithm can be applied over both original and reduced test suite depending upon the test suite's size or the need for accuracy. In the obtained results, the efficiency of the prioritization algorithms has been analyzed by the Average Percentage of Code Coverage (APCC) and Average Percentage of Code Coverage with cost (APCCc). A comparison of the proposed approach is also done with the previously proposed methods and it is observed that APCC & APCCc values achieve higher percentage values faster in the case of the prioritized test suite in contrast to the non-prioritized test suite.

scholarly journals Improving Fault Detection Rate using Similarity-based Test Case Prioritization in Regression Testing

2019 ◽  
Vol 9 (1) ◽  
pp. 1874-1880
Keyword(s):  
Rapid Evolution ◽  
Regression Testing ◽  
Maximum Efficiency ◽  
Test Case ◽  
Test Cases ◽  
Customer Requirements ◽  
Average Percentage ◽  
Software Developer ◽  
Complete Test

Rapid evolution in software requires regression testing to be performed as an essential activity which validates the software before the next release. Where software developer may add or removes intended features to maintain the software according to the customer requirements. In that case, complete test cases execution is nearly infeasible due to limited time and resources. So, the main aim of prioritization is to test any software with minimal time and maximum efficiency in terms of fault coverage rate. This paper proposed different similarity-based prioritization techniques to provide ranking to the test cases based on their influence level which is computed as similarity degree in three levels for the software to be tested. Each level represents the integration of selected coverage criteria’s. In order to validate our proposed technique, we have conducted a case study to measure its effectiveness in prioritizing the test cases. We experimentally observed that by incorporating a similarity-based approach with more than one coverage criteria; results for similarity-based prioritization are promising than any other conventional coverage based approaches in terms of Average Percentage of Faults Detected.

scholarly journals Tool for Generating Behavior-Driven Development Test-Cases

2020 ◽  
Vol 6 (1) ◽  
pp. 27
Author(s):  
Indra Kharisma Raharjana ◽  
Fadel Harris ◽  
Army Justitia
Keyword(s):  
Web Application ◽  
Web Applications ◽  
Test Case ◽  
Test Cases ◽  
Use Case ◽  
Case Scenario ◽  
Case File ◽  
Entry Level ◽  
Generate Test Case ◽  
Agile Software

Background: Testing using Behavior-Driven Development (BDD) techniques is one of the practices of Agile software development. This technique composes a test-case based on a use case scenario, for web application acceptance tests.Objective:  In this study, we developed a tool to generate test case codes from BDD scenario definitions to help and facilitate practitioners to conduct testing.Methods: The generated test case code is made according to the codeception framework format so that it can be directly executed by the tester. The procedure is performed as follows:  map the correlation of the language used in BDD (gherkin language) and the code syntax of the test code in the codeception framework, designed the GUIs in such a way that users can easily transform the Use Case Scenario, built the tool so that it can generate test cases codes. Evaluation is done by gathering respondents; ask to run the application and gathering feedback from respondents.Results: This tool can generate a codeception test-case file based on the BDD scenario. Generated test cases can be directly used on codeception tools. The results of the evaluation show that the tools can help entry-level programmers in developing automated tests.Conclusion: The tool can help user especially entry-level programmers to generate BDD test-case and make easy for the users for testing the web applications.

Test Case Prioritization—ANT Algorithm With Faults Severity

2020 ◽  
Author(s):  
Andreea Vescan ◽  
Camelia-M Pintea ◽  
Petrică C Pop
Keyword(s):  
Selection Criterion ◽  
Regression Testing ◽  
Test Case ◽  
Test Cases ◽  
Test Case Prioritization ◽  
Testing Time ◽  
Average Percentage ◽  
Prioritization Method ◽  
The Cost ◽  
Run Test

Abstract Regression testing is applied whenever a code changes, ensuring that the modifications fixed the fault and no other faults are introduced. Due to a large number of test cases to be run, test case prioritization is one of the strategies that allows to run the test cases with the highest fault rate first. The aim of the paper is to present an optimized test case prioritization method inspired by ant colony optimization, test case prioritization–ANT. The criteria used by the optimization algorithm are the number of faults not covered yet by the selected test cases and the sum of severity of the faults. The cost, i.e. time execution, for test cases is considered in the computation of the pheromone deposited on the graph’s edges. The average percentage of fault detected metric, as best selection criterion, is used to uncover maximum faults with the highest severity, and reducing the regression testing time. Several experiments are considered, detailed and discussed, comparing various algorithm parameter’s alternatives. A benchmark project is also used to validate the proposed approach. The obtained results are encouraging, being a cornerstone for new perspectives to be considered.

scholarly journals STUDY OF TEST CASE PRIORITIZATION TECHNIQUE USING APFD

2013 ◽  
Vol 10 (3) ◽  
pp. 1475-1481
Author(s):  
Rahul Gupta ◽  
Akhilesh Kumar Yadav
Keyword(s):  
Fault Detection ◽  
Software Development ◽  
Regression Testing ◽  
Test Case ◽  
Test Cases ◽  
Test Case Prioritization ◽  
Average Percentage

Regression testing is used to ensure that bugs are fixed and new functionality introduce in a new version of a software that don't adversely affect the original functionality inherited from the previous version.Regression testing is one of the most complaining activities of software development and maintenance.Unluckily, It may have feeble resources to allow for the re-execution of all test cases during regression testing. In this situation the use of test case prioritization is profitable because the best appropriate test cases are executed first. In this paper we are proposing an algorithm to prioritize test cases based on rate of fault detection and impact of fault.The proposed algorithm recognises the exhausting fault at earlier stage of the testing process.We are using an Average Percentage of Faults Detected (APFD) metric to determine the effectiveness of the new test case arrangements.

scholarly journals TEST CASE REDUCTION USING STATEMENT COVERAGE BASED ANTCOLONY SYSTEM

2021 ◽  
Vol 9 (2) ◽  
pp. 109-114
Author(s):  
Dr. C. P. Indumathi, Et. al.
Keyword(s):  
Local Search ◽  
Priority Setting ◽  
Regression Testing ◽  
Experimental Results ◽  
Ant Colony ◽  
Test Case ◽  
Ant Colony System ◽  
Test Cases ◽  
Average Percentage ◽  
Search Mechanism

Prioritization of test cases and ordering them for improving the performance of regression testing has become an important researchsubject in recent technology. This paper presents an appropriate method for the Ant Colony System (ACS) to address the problem ofcoverage-based test case priority setting. A tour-based heuristic mechanism and a tree-shaped updation of pheromone rule are used inthis method. The underlying logic is in their later journey, the partially built solutions of the antsare used, and their search is variedsimultaneously. To improve the algorithm’s convergence speeda sorting based local search mechanism was used. The propound method is tested and the experimental results have shown that this technique will surpass other state-of-the-artmethods in terms of Average Percentage of Statement Coverage(APSC).Subsequently ,reduced significant number of test cases and help the software testers for immediate testing process.

Sign in / Sign up

Export Citation Format

Share Document