generating structured test data with specific properties
play

Generating Structured Test Data with Specific Properties using - PowerPoint PPT Presentation

Generating Structured Test Data with Specific Properties using Metaheuristic and Nested Monte-Carlo Search Simon Poulding Blekinge Institute of Technology Robert Feldt Chalmers University Context software testing: generating test data for


  1. Generating Structured Test Data with Specific Properties using Metaheuristic and Nested Monte-Carlo Search Simon Poulding Blekinge Institute of Technology Robert Feldt Chalmers University

  2. Context software testing: generating test data for software for which inputs are highly structured Problem how to enable the test engineer to generate test data that is both valid and has desirable properties? Solution (1) allow the test engineer to specify the construction of valid test inputs using generators written in a general purpose language (2) apply metaheuristic and Monte-Carlo tree search algorithms to optimise the generation process for the desirable properties

  3. GödelTest + Metaheuristic Search + Nested Monte-Carlo Search Application: Robustness Testing

  4. generator @generator AZStrings begin start() = String( mult (letter)) letter() = choose(Bool) ? 'A' : 'B' end Julia implementation of GödelTest: https://github.com/simonpoulding/DataGenerators.jl

  5. generator @generator AZStrings begin start() = String( mult (letter)) letter() = choose(Bool) ? 'A' : 'B' end choice model choice point choice point range: [0, ∞ ) range: [false,true] distribution: geometric ( p 1 ) distribution: Bernoulli ( p 2 ) Julia implementation of GödelTest: https://github.com/simonpoulding/DataGenerators.jl

  6. generator @generator ABStrings begin start() = String( mult (letter)) letter() = choose(Bool)? 'A' : 'B' end choice point range: [0, ∞ ) distribution: geometric ( p 1 =0.5 ) “AB” probability “A” “” “BBA” 0 1 2 3 4 5

  7. generator @generator ABStrings begin start() = String( mult (letter)) letter() = choose(Bool)? 'A' : 'B' end choice point range: [0, ∞ ) distribution: geometric ( p 1 =0.1 ) “BBABAB” probability “BBAAABAA” “ABBA” “AABAAB” 0 1 2 3 4 5

  8. “AAABAA” ( p 1 , p 2 ) = (0.1, 0.2) “ABAAAAAA” “AAA” “BAAAAB” “BAB” “B” “” ( p 1 , p 2 ) = (0.5, 0.5) “ABBA”

  9. GödelTest + Metaheuristic Search + Nested Monte-Carlo Search Application: Robustness Testing

  10. “AAABAA” samples “ABAAABAA” generator “AAA” “BAAAAB” GödelSequences [3,0,4,1,2] property metrics parameters metaheuristic choice model search ( p 1 , p 2 ) = (0.1, 0.2)

  11. target 1: size = 100 AND height = 36 height size target 2: size = 100 AND height = 6 Robert Feldt and Simon Poulding, Finding Test Data with Specific Properties via Metaheuristic Search, Proc. International Symposium on Software Reliability Engineering (ISSRE 2013)

  12. 80 60 Tree height 40 20 100 200 Tree size Boltzmann Sampler

  13. 80 80 60 60 Tree height Tree height 40 40 20 20 100 200 100 200 Tree size Tree size GödelTest using Differential Evolution

  14. GödelTest + Metaheuristic Search + Nested Monte-Carlo Search Application: Robustness Testing

  15. current game state child states simulation

  16. current game state child states simulation

  17. current game state child states simulation

  18. current game state child states simulation

  19. current game state child states simulation

  20. current game state child states simulation 0.7

  21. current game state child states 0.4 simulation 0.7

  22. current game state child states 0.4 simulation 0.7 0.9

  23. [ ] [0] [1] [2] [0,0] [1,0] [2,1] simulation [0,0,3] [2,1,2] 0.4 [0,0,3,0] [2,1,2,1] 0.7 0.9

  24. size target: size = 100 Simon Poulding and Robert Feldt, Generating structured test data with specific properties using nested Monte-Carlo search, Proc. Genetic and Evolutionary Computation Conference (GECCO), 1279-1286, 2014

  25. 4000 consructions per target 3000 number of tree structure 2000 1000 0 Boltzmann NMCS 1 NMCS 2 NMCS 4 algorithm

  26. 150 time per target structure 125 100 (ms) 75 50 25 0 Boltzmann NMCS 1 NMCS 2 NMCS 4 algorithm

  27. 1.00 median coordinate 0.75 0.50 0.25 0.00 Boltzmann NMCS 1 NMCS 2 NMCS 4 NMCS 8 NMCS 16 algorithm

  28. height size target: size = 101 AND height = 8

  29. 8 8 height height 0 0 1 101 1 101 size size ‘random’ sampler NMCS

  30. GödelTest + Metaheuristic Search + Nested Monte-Carlo Search Application: Robustness Testing

  31. <math> <mfrac> <mrow> <mn> 1 </mn> <mo> + </mo> <msqrt> JEuclid <mn> 5 </mn> </msqrt> </mrow> <mn> 2 </mn> </mfrac> </math> Simon Poulding and Robert Feldt Generating Controllably Invalid and Atypical Inputs for Robustness Testing, Proc. International Workshop on Testing Extra-Functional Properties (ITEQS 2017)

  32. A 2 modifying choice model A 1 I 2 I 1 T mutating typical test set choice model

  33. normalised information content in errors/warnings 0.005 0.015 0.01 0 T A 1 T A 1 A 2 A 2 I 1 I 1 I 2 I 2

  34. Context software testing: generating test data for software for which inputs are highly structured Problem how to enable the test engineer to generate test data that is both valid and has desirable properties? Solution (1) allow the test engineer to specify the construction of valid test inputs using generators written in a general purpose language (2) apply metaheuristic and Monte-Carlo tree search algorithms to optimise the generation process for the desirable properties

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend