CBR and reduce amount of time, while preserving the ability of CBR system’s problem solving skill. Therefore, this paperapplies those effective deletion techniques to resolve theproblems of software testing.In the light of software testing, the proposed techniquesfocus on how to maintain the test case while maintaining thecapability of fault detection. It is appear that test cases in thispaper are treated as cases in the CBR system. Also, there is anassumption that a given set of test cases are generated by apath-oriented test case generation technique. The path-orientedtechnique is widely used for a white-box testing that derivestest cases from available source code.Section 2 discusses an overview of test case reductiontechniques and approach to maintain CBR. Section 3 providesa definition of terminologies used in this paper. Section 4 liststhe outstanding research issues motivated this study. Section 5proposes deletion algorithms using the concept of CBR.Section 6 describes an evaluation method and discusses anevaluation result. The last section represents all sourcereferences used in this paper.II.
This section describes an overview of test case reductiontechniques and the concept of case based maintenance. Thefollowing describes those two areas in details.
Test Case Reduction Techniques
This section discusses and organizes test case reduction (orTCR) techniques researched in 1995-2006. This study showsthat there are many researchers who proposed a method toreduce unnecessary test cases (also known as redundancy testcases), like Offutt , Rothermel , McMaster  andSampth . These techniques aim to remove and minimize asize of test cases while maintaining the ability to detect faults.The literature review , , , , , , , ,, , ,  shows that there are two types of reduction techniques, which are: (a) pre-process and (b) post-process. First, the pre-process is a process that immediatelyreduces a size of test cases after generating. Typically, it isoccurred before regression testing phase. Second, the post-process is a process that maintains and removes unnecessarytest cases, after running the first regression testing activities.Although these techniques can reduce the size of test cases, butthe ability to reveal faults seems slightly to be dropped.However, Jefferson Offutt  and Rothermel , , , ,, , , ,  has proven that these test casereduction techniques have many benefits, particularly duringthe regression testing phase, and most of reduction techniquescan maintain an acceptable rate of fault detection. Theadvantages of these techniques are: (a) to spend less time inexecuting test cases, particularly during the regression testingphase (b) to significantly reduce time and cost of manuallycomparing test results and (c) to effectively manage the testdata associated with test cases. This study proposes a new “2C”classification of test case reduction techniques, classified basedon their characteristics, as follows: (a) coverage-basedtechniques and (b) concept analysis-based techniques.
Case-Based Maintenance (CBM)
Due to the CBR’s life cycle , the case base size growsrapidly. That is caused a serious problem directly, for instance,duplicate data, inconsistency data, incorrect data, and anexpense of searching for an appropriate case in a large casebase size. CBR can be classified as one of the ArtificialIntelligence algorithms. CBR solves new problem by retrievingthe similar case from the existing case base and then adapts theexisting case according to the target problem. Over the time,CBR is growing. When the uncontrollable case-based growth isoccurred, the performance of CBR is decreasing. Therefore, themaintenance process is required in order to preserve or improvethe performance of the system. The process of maintainingCBR is called CBM. David C. Wilson  presented the overallconcepts of CBR and case based maintenance. This paperfocused on the case based maintenance (CBM) approach interm of the framework. In other words, this paper described thetype of data collection and how the case based maintenanceworks. There were so many policies for CBM, for example,addition, deletion, and retain.
“CBM was defined as the process of refining a CBR system’scase-base to improve the system’s performance. It implements policies for revising the organization or contents(representation, domain content, accounting information, or implementation) of the case-base in order to facilitate futurereasoning for a particular set of performance objectives.”
These studies , , , , , ,  reveal thatseveral deletion algorithms have been proposed. For example, arandom approach (RD), utility deletion algorithm (UD),footprint deletion algorithm (FD), footprint utility deletionalgorithm (FUD) and iterative case filtering algorithm (ICF).RD is the simplest approach, which removes the caserandomly. UD deletes the case that has minimum utility value.Footprint algorithm uses the competence model and removesthe auxiliary case from the system. FUD is a hybrid approachbetween Utility algorithm and Footprint algorithm, and isconcerned with the competence model and the utility value.Finally, ICF focuses on the case, which the reachability set isgreater than the coverage set , .III.
This section describes a definition of CBR terminologiesused in the software testing area.
TABLE I. D
Element CBR Software TestingCoveragesetCoverage Set is theset of target problems,which it can be usedto solve successfully.Coverage set means aset of stages / elements, which theycan be used to testsuccessfully andreveal faults.ReachabilitysetReachability Set is theset of case bases thatcan be used to solveReachability set meansa set of test cases thatcan be used to reveal
Autonomous System Research Laboratory, Faculty of Science andTechnology, Assumption University.
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 6, September 201033http://sites.google.com/site/ijcsis/ISSN 1947-5500