IPSETFUL： an iterative process of selecting test cases for effective fault localization by exploring concept lattice of program spectra

Fault localization is an important and challeng- ing task during software testing. Among techniques studied in this field, program spectrum based fault localization is a promising approach. To perform spectrum based fault local- ization, a set of test oracles should be provided, and the ef- fectiveness of fault localization depends highly on the quality of test oracles. Moreover, their effectiveness is usually af- fected when multiple simultaneous faults are present. Faced with multiple faults it is difficult for developers to determine when to stop the fault localization process. To address these issues, we propose an iterative fauk localization process, i.e., an iterative process of selecting test cases for effective fault localization （IPSETFUL）, to identify as many faults as pos- sible in the program until the stopping criterion is satisfied. It is performed based on a concept lattice of program spec- trum （CLPS） proposed in our previous work. Based on the labeling approach of CLPS, program statements are catego- rized as dangerous statements, safe statements, and sensitive statements. To identify the faults, developers need to check the dangerous statements. Meantime, developers need to se- lect a set of test cases covering the dangerous or sensitive statements from the original test suite, and a new CLPS is generated for the next iteration. The same process is pro- ceeded in the same way. This iterative process ends until there are no failing tests in the test suite and all statements on the CLPS become safe statements. We conduct an empirical study on several subject programs, and the results show that IPSETFUL can help identify most of the faults in the program with the given test suite. Moreover, it can save much effort in inspecting unfaulty program statements compared with the existing spectrum based fault localization techniques and the relevant state of the art technique.

Fault Coverage-Based Test Case Prioritization and Selection Using African Buffalo Optimization

Software needs modifications and requires revisions regularly.Owing to these revisions,retesting software becomes essential to ensure that the enhancements made,have not affected its bug-free functioning.The time and cost incurred in this process,need to be reduced by the method of test case selection and prioritization.It is observed that many nature-inspired techniques are applied in this area.African Buffalo Optimization is one such approach,applied to regression test selection and prioritization.In this paper,the proposed work explains and proves the applicability of the African Buffalo Optimization approach to test case selection and prioritization.The proposed algorithm converges in polynomial time(O(n^(2))).In this paper,the empirical evaluation of applying African Buffalo Optimization for test case prioritization is done on sample data set with multiple iterations.An astounding 62.5%drop in size and a 48.57%drop in the runtime of the original test suite were recorded.The obtained results are compared with Ant Colony Optimization.The comparative analysis indicates that African Buffalo Optimization and Ant Colony Optimization exhibit similar fault detection capabilities(80%),and a reduction in the overall execution time and size of the resultant test suite.The results and analysis,hence,advocate and encourages the use of African Buffalo Optimization in the area of test case selection and prioritization.

Method for test case selection and execution of web application regression testing

In order to improve the efficiency of regression testing in web application,the control flow graph and the greedy algorithm are adopted.This paper considers a web page as a basic unit and introduces a test case selection method for web application regression testing based on the control flow graph.This method is safe enough to the test case selection.On the base of features of request sequence in web application,the minimization technique and the priority of test cases are taken into consideration in the process of execution of test cases in regression testing for web application.The improved greedy algorithm is also raised resulting in optimization of execution of test cases.The experiments indicate that the number of test cases which need to be retested is reduced,and the efficiency of execution of test cases is also improved.

Novel technique for cost reduction in mutation testing

Aimed at the problem of expensive costs in mutation testing which has hampered its wide use,a technique of introducing a test case selection into the process of mutation testing is proposed.For each mutant,a fixed number of test cases are selected to constrain the maximum allowable executions so as to reduce useless work.Test case selection largely depends on the degree of mutation.The mutation distance is an index describing the semantic difference between the original program and the mutated program.It represents the percentage of effective test cases in a test set,so it can be used to guide the selection of test cases.The bigger the mutation distance is,the easier it is that the mutant will be killed,so the corresponding number of effective test cases for this mutant is greater.Experimental results suggest that the technique can remarkably reduce execution costs without a significant loss of test effectiveness.

Component system regression testing method based on CTAM

The emphasis of component system regression testing is retesting of the event interaction between updated components and other components in a system.A component system regression testing method based on a new component testing association model （CTAM） is proposed.First,the modification-affected component groups are identified by the impact analysis on CTAM,and each component in this group is assigned with an influence degree.Then,previous test cases are selected according to the influence degree,to generate the minimal regression test suite.Compared with traditional methods,CTAM is derived from the statistic on the interactive events that occurred in previous test executions,and focuses on the complicated relationship between components,which is more applicable to the component system regression testing.

Test selection and optimization for PHM based on failure evolution mechanism model

The test selection and optimization （TSO） can improve the abilities of fault diagnosis, prognosis and health-state evalua- tion for prognostics and health management （PHM） systems. Traditionally, TSO mainly focuses on fault detection and isolation, but they cannot provide an effective guide for the design for testability （DFT） to improve the PHM performance level. To solve the problem, a model of TSO for PHM systems is proposed. Firstly, through integrating the characteristics of fault severity and propa- gation time, and analyzing the test timing and sensitivity, a testability model based on failure evolution mechanism model （FEMM） for PHM systems is built up. This model describes the fault evolution- test dependency using the fault-symptom parameter matrix and symptom parameter-test matrix. Secondly, a novel method of in- herent testability analysis for PHM systems is developed based on the above information. Having completed the analysis, a TSO model, whose objective is to maximize fault trackability and mini- mize the test cost, is proposed through inherent testability analysis results, and an adaptive simulated annealing genetic algorithm （ASAGA） is introduced to solve the TSO problem. Finally, a case of a centrifugal pump system is used to verify the feasibility and effectiveness of the proposed models and methods. The results show that the proposed technology is important for PHM systems to select and optimize the test set in order to improve their performance level.

System level test selection based on combinatorial dependency matrix

Test selection is to select the test set with the least total cost or the least total number from the alternative test set on the premise of meeting the required testability indicators.The existing models and methods are not suitable for system level test selection.The first problem is the lack of detailed data of the units’fault set and the test set,which makes it impossible to establish a traditional dependency matrix for the system level.The second problem is that the system level fault detection rate and the fault isolation rate(referred to as"two rates")are not enough to describe the fault diagnostic ability of the system level tests.An innovative dependency matrix(called combinatorial dependency matrix)composed of three submatrices is presented.The first problem is solved by simplifying the submatrix between the units’fault and the test,and the second problem is solved by establishing the system level fault detection rate,the fault isolation rate and the integrated fault detection rate(referred to as"three rates")based on the new matrix.The mathematical model of the system level test selection problem is constructed,and the binary genetic algorithm is applied to solve the problem,which achieves the goal of system level test selection.

Application of Rollout Strategy to Test Points Selection for Integer-Coded Fault Wise Table

Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In this paper, this problem is formulated as a heuristic depth-first graph search problem at first. The graph node expanding method and rules are given. Then, rollout strategies are applied, which can be combined with the heuristic graph search algorithms, in a computationally more efficient manner than the optimal strategies, to obtain solutions superior to those using the greedy heuristic algorithms. The proposed rollout-based test points selection algorithm is illustrated and tested using an analog circuit and a set of simulated integer-coded fault wise tables. Computa- tional results are shown, which suggest that the rollout strategy policies are significantly better than other strategies.

Selection of Minimal Test Points Set for Integer-Coded Fault Wise Table

Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of traditional exhaustive is low. A tradeoff method between the high time complexity and low space complexity is proposed. At first, a new fault-pair table is constructed based on the integer-coded fault wise table. The fault-pair table consists of two columns： one column represents fault pair and the other represents test points set that can distinguish the corresponding faults. Then, the rows are arranged in ascending order according to the cardinality of corresponding test points set. Thirdly, test points in the top rows are selected one by one until all fault pair are isolated. During the test points selection process, the rows that contain selected test points are deleted and then the dimension of fault-pair table decreases gradually. The proposed test points selection algorithm is illustrated and tested using an integercoded fault wise table derived from a real analog circuit. Computational results suggest show policies are better than the exhaustive strategy.

Improved Test Case Selection Algorithm to Reduce Time in Regression Testing

Regression testing(RT)is an essential but an expensive activity in software development.RT confirms that new faults/errors will not have occurred in the modified program.RT efficiency can be improved through an effective technique of selected only modified test cases that appropriate to the modifications within the given time frame.Earlier,several test case selection approaches have been introduced,but either these techniques were not sufficient according to the requirements of software tester experts or they are ineffective and cannot be used for available test suite specifications and architecture.To address these limitations,we recommend an improved and efficient test case selection(TCS)algorithm for RT.Our proposed technique decreases the execution time and redundancy of the duplicate test cases(TC)and detects onlymodified changes that appropriate to themodifications in test cases.To reduce execution time for TCS,evaluation results of our proposed approach are established on fault detection,redundancy and already executed test case.Results indicate that proposed technique decreases the inclusive testing time of TCS to execute modified test cases by,on average related to a method of Hybrid Whale Algorithm(HWOA),which is a progressive TCS approach in regression testing for a single product.

Optimal Test Points Selection Based on Multi-Objective Genetic Algorithm

A new approach to select anoptimal set of test points is proposed. The described method uses fault-wise table and multi-objective genetic algorithm to find the optimal set of test points. First, the fault-wise table is constructed whose entries are measurements associated with faults and test points. The selection of optimal test points is transformed to the selection of the columns that isolate the rows of the table. Then, four objectives are described according to practical test requirements. The multi-objective genetic algorithm is explained. Finally, the presented approach is illustrated by a practical example. The results indicate that the proposed method can efficiently and accurately find the optimal set of test points and is practical for large scale systems.

Selection of Winter Rape Varieties in the National Early Maturing Area

[Objective] This study aimed to promote the sustainable development of rape industry, and to meet the growing demand of urban and rural residents for vegetable oil. [Method] Field test was conducted for winter rape varieties in the national early maturing area in 2015, and their yield, main economic traits, growth period, consistency and stress resistance were evaluated comprehensively. [Result] Xiangyou 420, Qingza 12, Qianyouzao 3 and Yunyouza 16 could be applied in Baoshan City, Yunnan Province, and Yangguang 1418, Shengguang 127 and Qingza 10 （CK） should be further tested. [Conclusion] The results can be demonstratively applied in Baoshan City and other similar regions, so as to promote the development of rape industry.

Biochemically curative surgery for gastrinoma in multiple endocrine neoplasia type 1 patients

AIM： To search for the optimal surgery for gastrinoma and duodenopancreatic neuroendocrine tumors in patients with multiple endocrine neoplasia type 1. METHODS： Sixteen patients with genetically confirmed multiple endocrine neoplasia type 1 （MEN 1） and Zollinger-Ellison syndrome （ZES） underwent resection of both gastrinomas and duodenopancreatic neuroendocrine tumors （NETs） between 1991 and 2009. For localization of gastrinoma, selective arterial secretagogue injection test （SASI test） with secretin or calcium solution was performed as well as somatostatin receptor scintigraphy （SRS） and other imaging methods such as computed tomography （CT） or magnetic resonance imaging （MRI）. The modus of surgery for gastrinoma has been changed over time, searching for the optimal surgery： pancreaticoduodenectomy （PD） was first performed guided by localization with the SAST test, then local resection of duodenal gastrinomas with dissection of regional lymph nodes （LR）, and recently pancreas-preserving total duodenectomy （PPTD） has been performed for multiple duodenal gastrinomas. RESULTS： Among various types of preoperative localizing methods for gastrinoma, the SASI test was the most useful method. Imaging methods such as SRS or CT made it essentially impossible to differentiate functioning gastrinoma among various kinds of NETs. However, recent imaging methods including SRS or CT were useful for detecting both distant metastases and ectopic NETs; therefore they are indispensable for staging of NETs. Biochemical cure of gastrinoma was achieved in 14 of 16 patients （87.5%）; that is, 100% in 3 patients who underwent PD, 100% in 6 patients who underwent LR （although in 2 patients （33.3%） second LR was performed for recurrence of duodenal gastri- noma）, and 71.4% in 7 patients who underwent PPTD. Pancreatic NETs more than 1 cm in diameter were resected either by distal pancreatectomy or enucleations, and no hepatic metastases have developed postoperatively. Pathological study of the resected specimens revealed co-existence of pancreatic gastrinoma with duodenal gastrinoma in 2 of 16 patients （13%）, and G cell hyperplasia and/or microgastrinoma in the duodenal Brunner＇s gland was revealed in all of 7 duodenal specimens after PPTD. CONCLUSION： Aggressive resection surgery based on accurate localization with the SASI test was useful for biochemical cure of gastrinoma in patients with MEN 1.Imamura Metal. Curative resection of gastrinoma in MEN-1