Using program data-state scarcity to guide automatic test data generation

作者: Mohammad Alshraideh , Leonardo Bottaci , Basel A. Mahafzah

DOI: 10.1007/S11219-009-9083-X

关键词:

摘要: Finding test data to cover structural coverage criteria such as branch is largely a manual and hence expensive activity. A potential low cost alternative generate the required automatically. Search-based generation one approach that has attracted recent interest. This based on definition of an evaluation or function able discriminate between candidate cases with respect achieving given goal. The implemented by appropriate instrumentation program under test. then executed instrumented program. provides in terms "distance" computation achieved achieve Providing reliably tests are close far from covering goal feasible, search process converge solution, i.e., case satisfies For some programs, however, informative difficult define. operations performed these programs returns constant value for very wide range inputs. typical example this problem arises predicates depend Boolean-valued (flag) variable although not limited contain flag variables. Although methods known overcoming problems variables particular cases, more general near been tackled. paper presents new heuristic directing when at differentiate directs toward produce rare scarce states. Scarce inputs likely values. proposed method evaluated empirically number which existing inadequate.

参考文章(44)
Joachim Wegener, Automated Testing of Real-Time Tasks ,(2000)
André Baresel, Robert M. Hierons, Harmen Sthamer, Mark Harman, Lin Hu, Improving Evolutionary Testing By Flag Removal genetic and evolutionary computation conference. pp. 1359- 1366 ,(2002)
M. Roper, Computer aided software testing using genetic algorithms 10th International Quality Week. ,(1997)
Jonathan de Halleux, Nikolai Tillmann, Parameterized Unit Testing with Pex Tests and Proofs. pp. 171- 181 ,(2008) , 10.1007/978-3-540-79124-9_12
William B. Langdon, Koza John R, Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! Genetic Programming: Vol.1. Kluwer: Boston. (1998). ,(1998)
Richard A. Watson, Edwin D. de Jong, Jordan B. Pollack, Reducing bloat and promoting diversity using multi-objective methods genetic and evolutionary computation conference. pp. 11- 18 ,(2001)
David E. Goldberg, Kalyanmoy Deb, An Investigation of Niche and Species Formation in Genetic Function Optimization international conference on genetic algorithms. pp. 42- 50 ,(1989)
Leonardo Bottaci, Instrumenting Programs With Flag Variables For Test Data Search By Genetic Algorithms genetic and evolutionary computation conference. pp. 1337- 1342 ,(2002)
Maarten Keijzer, Efficiently representing populations in genetic programming Advances in genetic programming. pp. 259- 278 ,(1996)