Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Fine-Grained Test Minimization

View through CrossRef
As a software system evolves, its test suite can accumulate redundancies over time. Test minimization aims at removing redundant test cases. However, current techniques remove whole test cases from the test suite using test adequacy criteria, such as code coverage. This has two limitations, namely (1) by removing a whole test case the corresponding test assertions are also lost, which can inhibit test suite effectiveness, (2) the issue of partly redundant test cases — tests with redundant test statements — is ignored. We propose a novel approach for fine-grained test case minimization, which removes redundancies at the test statement level, while preserving the coverage and test assertions of the test suite. Our analysis is based on the inference of a test suite model that enables automated test reorganization within test cases. We evaluated our approach, implemented in a tool called Testler, on the test suites of 15 open source projects. Our analysis revealed that over 4,639 (24%) of the tests in these test suites are partly redundant, with over 11,819 redundant test statements in total. Our results show that Testler removes 43% of the redundant test statements, reducing the number of partly redundant tests by 52%. As a result, test suite execution time is reduced by up to 37% (20% on average), while maintaining the original code coverage, branch coverage, and test assertions.
Title: Fine-Grained Test Minimization
Description:
As a software system evolves, its test suite can accumulate redundancies over time.
Test minimization aims at removing redundant test cases.
However, current techniques remove whole test cases from the test suite using test adequacy criteria, such as code coverage.
This has two limitations, namely (1) by removing a whole test case the corresponding test assertions are also lost, which can inhibit test suite effectiveness, (2) the issue of partly redundant test cases — tests with redundant test statements — is ignored.
We propose a novel approach for fine-grained test case minimization, which removes redundancies at the test statement level, while preserving the coverage and test assertions of the test suite.
Our analysis is based on the inference of a test suite model that enables automated test reorganization within test cases.
We evaluated our approach, implemented in a tool called Testler, on the test suites of 15 open source projects.
Our analysis revealed that over 4,639 (24%) of the tests in these test suites are partly redundant, with over 11,819 redundant test statements in total.
Our results show that Testler removes 43% of the redundant test statements, reducing the number of partly redundant tests by 52%.
As a result, test suite execution time is reduced by up to 37% (20% on average), while maintaining the original code coverage, branch coverage, and test assertions.

Related Results

Provocative Tests in Diagnosis of Thoracic Outlet Syndrome: A Narrative Review
Provocative Tests in Diagnosis of Thoracic Outlet Syndrome: A Narrative Review
Abstract Thoracic outlet syndrome (TOS) is a group of conditions caused by the compression of the neurovascular bundle within the thoracic outlet. It is classified into three main ...
The neural basis of intelligence in fine-grained cortical topographies
The neural basis of intelligence in fine-grained cortical topographies
Abstract Intelligent thought is the product of efficient neural information processing, which is embedded in fine-grained, topographically-organized population resp...
Imbalanced image classification algorithm based on fine-grained analysis
Imbalanced image classification algorithm based on fine-grained analysis
Fine-grained attribute analysis and data imbalance have always been research hotspots in the field of computer vision. Due to the complexity and diversity of fine-grained attribute...
FGEFNet: Fine-Grained Extraction and Flow Network for Crowd Counting
FGEFNet: Fine-Grained Extraction and Flow Network for Crowd Counting
Abstract Crowd counting is an important application of artificial intelligence in computer graphics and one of the most challenging research areas in the field of computer ...
The mechanisms of minimization: How interrogation tactics suggest lenient sentencing through pragmatic implication
The mechanisms of minimization: How interrogation tactics suggest lenient sentencing through pragmatic implication
Objective: Minimization is a legal interrogation tactic in which an interrogator attempts to decrease a suspect's resistance to confessing by, for example, downplaying the seriousn...
Open-Vocabulary Fine-Grained Hand Action Detection
Open-Vocabulary Fine-Grained Hand Action Detection
In this work, we address the new challenge of open-vocabulary fine-grained hand action detection, which aims to recognize hand actions from both known and novel categories using te...

Back to Top