scholarly journals Selection of Best Test Cases using Support Vector Machine for ARPT

2019 ◽  
Vol 8 (3) ◽  
pp. 4265-4271
Keyword(s):  
Support Vector Machine ◽  
Software Testing ◽  
Support Vector ◽  
Test Cases ◽  
Testing Strategy ◽  
Random Partition ◽  
Code Coverage ◽  
Time Consumption ◽  
Branch Coverage ◽  
Selection Of

Software testing is an essential activity in software industries for quality assurance; subsequently, it can be effectively removing defects before software deployment. Mostly good software testing strategy is to accomplish the fundamental testing objective while solving the trade-offs between effectiveness and efficiency testing issues. Adaptive and Random Partition software Testing (ARPT) approach was a combination of Adaptive Testing (AT) and Random Partition Approach (RPT) used to test software effectively. It has two variants they are ARPT-1 and ARPT-2. In ARPT-1, AT was used to select a certain number of test cases and then RPT was used to select a number of test cases before returning to AT. In ARPT-2, AT was used to select the first m test cases and then switch to RPT for the remaining tests. The computational complexity for random partitioning in ARPT was solved by cluster the test cases using a different clustering algorithm. The parameters of ARPT-1 and ARPT-2 needs to be estimated for different software, it leads to high computation overhead and time consumption. It was solved by Improvised BAT optimization algorithms and this approach is named as Optimized ARPT1 (OARPT1) and OARPT2. By using all test cases in OARPT will leads to high time consumption and computational overhead. In order to avoid this problem, OARPT1 with Support Vector Machine (OARPT1-SVM) and OARPT2- SVM are introduced in this paper. The SVM is used for selection of best test cases for OARPT-1 and OARPT-2 testing strategy. The SVM constructs hyper plane in a multi-dimensional space which is used to separate test cases which have high code and branch coverage and test cases which have low code and branch coverage. Thus, the SVM selects the best test cases for OARPT-1 and OARPT-2. The selected test cases are used in OARPT-1 and OARPT-2 to test software. In the experiment, three different software is used to prove the effectiveness of proposed OARPT1- SVM and OARPT2-SVM testing strategies in terms of time consumption, defect detection efficiency, branch coverage and code coverage.

scholarly journals A Stochastic Method for Test Case Selection in Software Testing

2020 ◽  
Vol 8 (4S5) ◽  
pp. 265-271
Keyword(s):  
Software Development ◽  
Software Testing ◽  
Test Case ◽  
Test Cases ◽  
Nsga Ii ◽  
Code Coverage ◽  
Test Case Selection ◽  
Redundant Data ◽  
Case Selection ◽  
Selection Of

The quality of the software is a very important aspect in the development of software application. In order to make sure there is the software of good quality, testing is a critical activity of software development. Thus, software testing is the activity which focuses on the computation of an attribute or the ability of either a system or program that decides if user requirements are met. There is a proper strategy for the design of software for which testing has to be adopted. The techniques of test case selection attempt at reduction of the test cases that need to be executed at the same time satisfying the needs of testing that has been denoted by the test criteria. In the time of software testing, and the resource will be the primary constraints at the time of testing since this has been a highly neglected phase in the Software Development Life Cycle (SDLC). The optimizing of a test suite is very critical for the reduction of the testing phase and also the selection of the test cases that eliminate unwanted or redundant data. All work in literature will make use of techniques of single objective optimization that does not have to be efficient as the code coverage will play an important role at the time of selection of test case. As the test case choice is Non-Deterministic, the work also proposes a novel and multi-objective algorithm like the Non-Dominated Sorting Genetic Algorithm II (NSGA II) and the Stochastic Diffusion Search (SDS) algorithm that makes use of the cost of execution and code coverage as its objective function. The results prove a faster level of convergence of the algorithm with better coverage of code in comparison to the NSGA II.

scholarly journals A Prioritization Approach for Regression Test Cases Based on a Revised Genetic Algorithm

2021 ◽  
Vol 50 (3) ◽  
pp. 443-457
Author(s):  
Thamer Alrawashdeh ◽  
Fuad ElQirem ◽  
Ahmad Althunibat ◽  
Roba Alsoub
Keyword(s):  
Genetic Algorithm ◽  
Software Testing ◽  
Regression Testing ◽  
Test Cases ◽  
Average Percentage ◽  
Lower Priority ◽  
Regression Test ◽  
Predefined Criterion ◽  
Good Coverage ◽  
Selection Of

The regression testing is a software-based testing approach executed to verify that changes made to the softwaredo not affect the existing functionality of the product. On account of the constraints of time and cost, it isimpractical to re-execute all the test cases for software whenever a change occurs. In order to overcome sucha problem in the selection of regression test cases, a prioritization technique should be employed. On the basisof some predefined criterion, the prioritization techniques create an execution schedule for the test cases, sothe higher priority test cases can be performed earlier than the lower priority test cases in order to improvethe efficiency of the software testing. Many prioritization criteria for regression test cases have been proposedin software testing literature; however, most of such techniques are code-based. Keeping in view this fact, thisresearch work has proposed a prioritization approach for regression test cases generated from software specificationswhich are based on the criterion of the Average Percentage Transition Coverage (APTC) by using arevised genetic algorithm. This criterion evaluates the rate of transitions coverage by incorporating knowledgeabout the significance of transitions between activates in the form of weights. APTC has been used as a fitnessevaluation function in a genetic algorithm to measure the effectiveness of a test cases sequence. Moreover, inorder to improve the coverage percentage, the proposed approach has revised the genetic algorithm by solvingthe problem of the optimal local solution. The experimental results show that the proposed approach demonstratesa good coverage performance with less execution time as compared to the standard genetic algorithmand some other prioritization techniques.

Green DRCT

2017 ◽  
Vol 7 (1) ◽  
pp. 14-29
Author(s):  
Sangharatna Godboley ◽  
Arpita Dutta ◽  
Durga Prasad Mohapatra
Keyword(s):  
Energy Consumption ◽  
Software Testing ◽  
Transformation Method ◽  
New Approach ◽  
Code Coverage ◽  
Coverage Metrics ◽  
Branch Coverage ◽  
Concolic Testing ◽  
Green Software ◽  
Environment Sustainability

Being a good software testing engineer, one should have the responsibility towards environment sustainability. By using green principles and regulations, we can perform Green Software Testing. In this paper, we present a new approach to enhance Branch Coverage and Modified Condition/Decision Coverage uses concolic testing. We have proposed a novel transformation technique to improve these code coverage metrics. We have named this new transformation method Double Refined Code Transformer (DRCT). Then, using JoulMeter, we compute the power consumption and energy consumption in this testing process. We have developed a tool named Green-DRCT to measure energy consumption while performing the testing process.

Performance Prediction by an SVM with a Firefly Optimization Method

2020 ◽  
pp. 2150017
Author(s):  
Yongquan Yan
Keyword(s):  
Support Vector Machine ◽  
Economic Loss ◽  
Optimization Method ◽  
Parameter Selection ◽  
Support Vector ◽  
Software Aging ◽  
Memory Prediction ◽  
Firefly Optimization ◽  
Aging Phenomena ◽  
Selection Of

Since software system is becoming more and more complex than before, performance degradation and even abrupt download, which are called software aging phenomena, bring about a great deal of economic loss. To counter these problems, some methods are used. Support vector machine is an effective method to tackle software aging problems, but its performance is influenced by the selection of hyper-parameters. A method is proposed to optimize the hyper-parameter selection of support vector machine in this work. The proposed method which is used as a training algorithm to optimize the parameter selection of support vector machine, utilizes the global exploration power of firefly method to achieve faster convergence and also a better accuracy. In the experiment, we use two metrics to test the effect of the proposed method. The results indicate that the presented method owns the highest accuracy in both the available memory prediction and heap memory prediction of Web server for software aging predictions.

Adaptive Hybrid Semantic Selection of SAWSDL Services with SAWSDL-MX2

2010 ◽  
Vol 6 (4) ◽  
pp. 1-26 ◽  
Author(s):  
Matthias Klusch ◽  
Patrick Kapahnke ◽  
Ingo Zinnikus
Keyword(s):  
Support Vector Machine ◽  
Comparative Evaluation ◽  
Structural Similarity ◽  
Support Vector ◽  
Test Collection ◽  
Semantic Matching ◽  
Retrieval Performance ◽  
Text Similarity ◽  
Random Subset ◽  
Selection Of

In this paper, the authors present an adaptive, hybrid semantic matchmaker for SAWSDL services, called SAWSDL-MX2. It determines three types of semantic matching of an advertised service with a requested one, which are described in standard SAWSDL: logic-based, text-similarity-based and XML-tree edit-based structural similarity. Before selection, SAWSDL-MX2 learns the optimal aggregation of these different matching degrees off-line over a random subset of a given SAWSDL service retrieval test collection by exploiting a binary support vector machine-based classifier with ranking. The authors present a comparative evaluation of the retrieval performance of SAWSDL-MX2.

A support vector machine model for intelligent selection of data representations

2014 ◽  
Vol 18 ◽  
pp. 70-81 ◽  
Author(s):  
Gabriela Czibula ◽  
Istvan Gergely Czibula ◽  
Radu Dan Gaceanu
Keyword(s):  
Support Vector Machine ◽  
Support Vector Machine Model ◽  
Support Vector ◽  
Machine Model ◽  
Data Representations ◽  
Selection Of
Sign in / Sign up

Export Citation Format

Share Document