scholarly journals Test Case Reduction based upon Path Coverage Criteria

2017 ◽  
Vol 172 (3) ◽  
pp. 11-19
Author(s):  
Monika Grover ◽  
Pradeep Kumar
Keyword(s):  
Test Case ◽  
Coverage Criteria ◽  
Path Coverage

scholarly journals Using predictive models to evaluate the quality of a test suite at class and method level.

2020 ◽  
Author(s):  
Keslley Lima Silva ◽  
Érika Cota
Keyword(s):  
Predictive Models ◽  
Continuous Process ◽  
Machine Learning Algorithms ◽  
Test Suite ◽  
Software Systems ◽  
Test Case ◽  
Test Coverage ◽  
Coverage Criteria ◽  
Class Level ◽  
Path Coverage

Testing is an indispensable part of the software development process and is a continuous process during the development life cycle. In this context, examining the behavior of software systems to reveal potential problems is a crucial task. To this end, the test suites usually are utilized to examine the software quality. However, test suite quality control is hard for the tester, especially in an evolving system. Such control is needed to assure and improve the test suite's quality and the application as a consequence. Currently, test coverage criteria are used as a mechanism to assist the tester in analyzing the test suite (e.g., find the weaknesses, and add a new test case or test inputs). However, more strong coverage criteria (potentially showing less glaring weaknesses) are challenging to assess. In this work, we propose a different approach to support the developer in evaluating the test suite quality based on more powerful test coverage criteria. We will follow the Knowledge Discovery in Database process using machine learning algorithms to estimate the prime path coverage at the method and class level. For this purpose, we will create two large datasets consisting of source code metrics and test case metrics from 12 open-source Java projects, and these datasets will be used in the training process to build the predictive models. Using the built models, we expected to predict the prime path coverage at the method and class level with a reliable prediction performance.

Comparing logic coverage criteria on test case prioritization

2012 ◽  
Vol 55 (12) ◽  
pp. 2826-2840 ◽  
Author(s):  
ChunRong Fang ◽  
ZhenYu Chen ◽  
BaoWen Xu
Keyword(s):  
Test Case ◽  
Test Case Prioritization ◽  
Coverage Criteria

A Analysis and Research on the Methods of Object Oriented Software Testing

2013 ◽  
Vol 709 ◽  
pp. 616-619
Author(s):  
Jing Chen
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Test Data ◽  
Object Oriented ◽  
Automatic Generation ◽  
Test Case Generation ◽  
Test Case ◽  
Test Cases ◽  
Path Coverage ◽  
Parameter Values

This paper proposes a genetic algorithm-based method to generate test cases. This method provides information for test case generation using state machine diagrams. Its feature is realizing automation through fewer generated test cases. In terms of automatic generation of test data based on path coverage, the goal is to build a function that can excellently assess the generated test data and guide the genetic algorithms to find the targeting parameter values.

scholarly journals Coverage Criteria for Set-Based Specifications

2015 ◽  
Vol 22 (2) ◽  
pp. 316
Author(s):  
Maximiliano Cristiá ◽  
Joaquín Cuenca ◽  
Claudia Frydman
Keyword(s):  
Structural Testing ◽  
Test Cases ◽  
Logical Formula ◽  
Coverage Criteria ◽  
Testing Strategies ◽  
Model Based Testing ◽  
Path Coverage ◽  
Input Domain ◽  
Domain Partition ◽  
Scripting Language

Model-based testing (MBT) studies how test cases are generated from a model of the system under test (SUT). Many MBT methods rely on building an automaton from the model and then they generate test cases by covering the automaton with different path coverage criteria. However, if a model of the SUT is a logical formula over some complex mathematical theories (such as set theory) it may be more natural or intuitive to apply coverage criteria directly over the formula. On the other hand, domain partition, i.e. the partition of the input domain of model operations, is one of the main techniques in MBT. Partitioning is conducted by applying different rules or heuristics. Engineers may find it difficult to decide what, where and how these rules should be applied. In this paper we propose a set of coverage criteria based on domain partition for set-based specifications. We call them testing strategies. Testing strategies play a similar role to path- or data-based coverage criteria in structural testing. Furthermore, we show a partial order of testing strategies as is done in structural testing. We also describe an implementation of testing strategies for the Test Template Framework, which is a MBT method for the Z notation; and a scripting language that allows users to implement testing strategies.

scholarly journals Test Case Generation for UML Behavioral Diagram by Traversal Algorithm

2019 ◽  
Vol 8 (10) ◽  
pp. 3262-3266
Keyword(s):  
Accurate Result ◽  
Test Case Generation ◽  
Test Case ◽  
Test Cases ◽  
Sequence Diagrams ◽  
Research Focus ◽  
Activity Diagram ◽  
Path Coverage ◽  
The Comparative Study ◽  
Traversal Algorithm

Software testing play crucial role in the software development as it consumes lot of time and resources. However testing process needs to be more efficiently done because overall software quality relies upon good testing approach. The present research focus on generation of test cases from UML diagrams. The combination graph is made by using activity and sequence diagrams. These diagrams proves to be more efficient as activity diagram gives the dynamic behavior of the model and sequence diagram is used to understand detailed functionality of the system. In this paper, a combined approach using Breadth first and depth first search is proposed which will generate expected test cases. The comparative study is done for test case generation using BFS and DFS algorithm and the result proves that the DFS traversal algorithm provides more accurate result for path coverage.

Sign in / Sign up

Export Citation Format

Share Document