A minimal test suite generation method based on quotient space theory

Authors:
Lei Wu;Longshu Li
Affiliations:
College of Computer Science and Technology, AnHui University, Hefei, Anhui, China and Department of Computer Teaching, Anhui University, Hefei Anhui, China;College of Computer Science and Technology, AnHui University, Hefei, Anhui, China
Venue:
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Year:
2011

Citing 5
Cited 0

A methodology for controlling the size of a test suite

ACM Transactions on Software Engineering and Methodology (TOSEM)
An enhanced zero-one optimal path set selection method

Journal of Systems and Software
Using Spanning Sets for Coverage Testing

IEEE Transactions on Software Engineering
A concept analysis inspired greedy algorithm for test suite minimization

PASTE '05 Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
An experimental comparison of four test suite reduction techniques

Proceedings of the 28th international conference on Software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The cost and effectiveness of software testing is determined by the quantity and quality of the test suite. In order to select the most efficient and least subset from the test suite, a minimal test suite generation method based on quotient space theory is proposed. Based on the testing requirements, decomposition method and synthesis technology of the quotient space theory are applied to give a partition of the test suite, and a set of effective algorithm of the minimal test suite generation is concluded.