The Coverall Algorithm for Test Cases Reduction
The Coverall Algorithm for Test Cases Reduction
Preeyavis Pringsulaka Faculty of Science and Technology Assumption University Bangkok 10240, Thailand 617-372-5440 iampree@yahoo.com Abstract—This paper1 proposes a technique called Coverall algorithm, which is based on a conventional attempt to reduce cases that have to be tested for any given software. The approach utilizes the advantage of Regression Testing where fewer numbers of test cases would lessen time consumption of the testing as a whole. The technique also offers a mean to perform test cases generation automatically. Comparing to the technique in most of the literatures where tester have no option but to perform the test cases generation manually, the proposed technique provides a better option. As for the test cases reduction, the technique uses simple algebraic condition to assign fixed values to variables (maximum, minimum and constant variables). By doing this, the variables value would be limited within a definite range, resulting in fewer numbers of possible test cases in process and also the technique can uses in program loops and arrays. After comparative assessment of the technique, it has been confirmed that the technique could reduce number of test cases by more than 99%. As for the other features of the technique, automatic test cases generation, all four step of test cases generation in the proposed technique have been converted into an operational program. The success of the program in performing these steps is indeed significant since it represents a practical means in performing test cases generation automatically by a computer algorithm. TABLE OF CONTENTS 1. INTRODUCTION ......................................................1 2. PROBLEM DESCRIPTION ........................................1 3. LITERATURE REVIEWS ..........................................2 4. PROPOSED TECHNIQUE ..........................................3 5. EVALUATION
Preeyavis Pringsulaka Faculty of Science and Technology Assumption University Bangkok 10240, Thailand 617-372-5440 iampree@yahoo.com Abstract—This paper1 proposes a technique called Coverall algorithm, which is based on a conventional attempt to reduce cases that have to be tested for any given software. The approach utilizes the advantage of Regression Testing where fewer numbers of test cases would lessen time consumption of the testing as a whole. The technique also offers a mean to perform test cases generation automatically. Comparing to the technique in most of the literatures where tester have no option but to perform the test cases generation manually, the proposed technique provides a better option. As for the test cases reduction, the technique uses simple algebraic condition to assign fixed values to variables (maximum, minimum and constant variables). By doing this, the variables value would be limited within a definite range, resulting in fewer numbers of possible test cases in process and also the technique can uses in program loops and arrays. After comparative assessment of the technique, it has been confirmed that the technique could reduce number of test cases by more than 99%. As for the other features of the technique, automatic test cases generation, all four step of test cases generation in the proposed technique have been converted into an operational program. The success of the program in performing these steps is indeed significant since it represents a practical means in performing test cases generation automatically by a computer algorithm. TABLE OF CONTENTS 1. INTRODUCTION ......................................................1 2. PROBLEM DESCRIPTION ........................................1 3. LITERATURE REVIEWS ..........................................2 4. PROPOSED TECHNIQUE ..........................................3 5. EVALUATION
References: [1] B. Beizer. “Software Testing Techniques.” Van Nostrand Reinhold, 2nd edition, 1990. [2] B. Korel, “Automated Software Test Data Generation,” Conference on Software Engineering, Vol 10, No. 8, pages 870-879, August 1990. [3] L. A. Clarke, “A System to Generate Test Data and Symbolically Execute Programs,” IEEE Transactions on Software Engineering, Vol. SE-2, No. 3, pages 215-222, September 1976. [4] L. J. Morell. “A Theory of Error-Based Testing,” PhD thesis, University of Maryland, College Park MD, 1984, Technical Report TR-1395 [5] M. J. Gallagher and V. L. Narsimhan, “ADTEST: A Test Data Generation Suite for Ada Software Systems,” IEEE Transactions on Software Engineering, Vol . 23, No. 8, pages 473-484, August 1997. [6] Neelam Gupta, A. P. Mathur and M. L. Soffa, “Automated Test Data Generation using An Iterative Relaxation Method,” ACM SIGSOFT Sixth International Symposium on Foundations of Software Engineering (FSE-6), pages 231-244, Orlando, Florida, November 1998. [7] Offutt A. Jefferson, J. Pan and J. M. Voas.“Procedures for Reducing the Size of Coverage-based Test Sets.” [8] Offutt A. Jefferson, Z. Jin and J. Pan. “The Dynamic Domain Reduction Procedure for Test Data Generation,” Software Practice and Experience,29(2):167-193, January 1997. 7 BIOGRAPHY Preeyavis Pringsulaka graduated the Bachelor degree from King Mongkut Institute of Technology Ladkrabang (Thailand) in major of Applied Statistics in year 2002. Next two years, he graduated the Master degree in Major of Information Technology from Assumption University (Thailand). By that time he worked as System Analysis especially in Software testing and Software development process at Softsuite company. He has been interesting in Software Engineering and planing to study Ph.D. program in United States. 8