slides available - FBK | SE

More documents

Recommendations

Info

Fitness Function The fitness function scores different inputs to the system according to the test goal which ones are ‘good’ (that we should develop/evolve further) which ones are useless (that we can forget about)
Fitness-guided search Fitness Input
Page 1 and 2: Search-Based Testing Phil McMinn Un
Page 3 and 4: Acknowledgements The material in so
Page 5 and 6: Conventional Testing manual design
Page 7 and 8: Conventional Testing manual design
Page 9 and 10: Random Test Data Generation Input
Page 11 and 12: Random Test Data Generation Input
Page 13 and 14: Search-Based Testing is an automate
Page 15: Fitness Function The fitness functi
Page 19 and 20: Fitness-guided search Fitness Input
Page 21 and 22: Publications since 1976 source: SEB
Page 23 and 24: International Symposium on Search-B
Page 25 and 26: Fitness Functions Often easy We oft
Page 27 and 28: J. Wegener and M. Grochtmann. Verif
Page 29 and 30: Conventional testing manual design
Page 31 and 32: Generating vs Checking Conventional
Page 33 and 34: Daimler Autonomous Parking System I
Page 36 and 37: Generation 0
Page 38 and 39: Generation 0 Generation 10 critical
Page 40 and 41: Test setup Search-Based Testing app
Page 42 and 43: Structural testing
Page 44 and 45: Structural testing fitness function
Page 46 and 47: Assertion testing assertion conditi
Page 48 and 49: Assertion testing assertion conditi
Page 50 and 51: Search Techniques
Page 52 and 53: Hill Climbing Fitness Input
Page 54 and 55: Hill Climbing Fitness Input
Page 56 and 57: Hill Climbing - Restarts Fitness In
Page 64 and 65: Simulated Annealing Fitness Input
Page 66 and 67:
Simulated Annealing Fitness Input
Page 68 and 69:
Simulated Annealing Fitness Input
Page 70 and 71:
Simulated Annealing Fitness Worse s
Page 72 and 73:
Evolutionary Algorithm Fitness Inpu
Page 74 and 75:
Evolutionary Algorithms inspired by
Page 76 and 77:
Crossover a b c d 10 10 20 40 a b c
Page 78 and 79:
Crossover a b c d 10 10 20 40 a 10
Page 80 and 81:
Mutation a b c 10 10 20 d 40
Page 82 and 83:
Mutation a b c d d 10 10 20 40 20
Page 84 and 85:
Evolutionary Testing
Page 86 and 87:
Evolutionary Testing Insertion Muta
Page 88 and 89:
Which search method Depends on char
Page 90 and 91:
Which search method Depends on char
Page 92 and 93:
Which search method Some landscapes
Page 94 and 95:
Which search method Some landscapes
Page 96 and 97:
Ingredients for an optimising searc
Page 98 and 99:
Ingredients for Search-Based Testin
Page 100 and 101:
Ingredients for Search-Based Testin
Page 102 and 103:
More search algorithms Tabu Search
Page 104 and 105:
Getting started in SBSE M. Harman a
Page 106 and 107:
Mutation Testing original
Page 108 and 109:
Mutation Testing mutant mutant
Page 110 and 111:
Mutation Testing mutant higher orde
Page 112 and 113:
Finding Good HOMs Due to the large
Page 114 and 115:
Subtle Mutants - Fitness Function r
Page 116 and 117:
Time aware test suite prioritisatio
Page 118 and 119:
Page 120 and 121:
Page 122 and 123:
Fitness Function The tester is unli
Page 124 and 125:
Multi-objective Search Instead of c
Page 126 and 127:
Multi-objective Search Fitness Func
Page 128 and 129:
Page 130 and 131:
Page 132 and 133:
Page 134 and 135:
Page 136 and 137:
Page 138 and 139:
Page 140 and 141:
Page 142 and 143:
Three objectives
Page 144 and 145:
Other applications of Search-Based
Page 146 and 147:
Covering a structure TARGET
Page 148 and 149:
Fitness evaluation The test data ex
Page 150 and 151:
Analysing control flow The outcomes
Page 152 and 153:
Approach Level = 2 TARGET
Page 154 and 155:
Approach Level = 2 = 1 TARGET = 0
Page 156 and 157:
Approach Level Roy P. Pargas, Mary
Page 158 and 159:
Analysing predicates Approach level
Page 160 and 161:
Branch distances for relational pre
Page 162 and 163:
Putting it all together Fitness = a
Page 164 and 165:
Putting it all together Fitness = a
Page 166 and 167:
Normalisation Functions Since the
Page 168 and 169:
Alternating Variable Method ‘Prob
Page 170 and 171:
Alternating Variable Method ‘Prob
Page 172 and 173:
Alternating Variable Method Acceler
Page 174 and 175:
Page 176 and 177:
Page 178 and 179:
Alternating Variable Method 1. Rand
Page 180 and 181:
Alternating Variable Method 1. Rand
Page 182 and 183:
Key Publications Alternating variab
Page 184 and 185:
Input Generation Using Automated No
Page 186 and 187:
IGUANA (Java) inputs Test object (C
Page 188 and 189:
IGUANA (Java) search algorithm inpu
Page 190 and 191:
A function for testing
Page 192 and 193:
Test Object Preparation 2. Instrume
Page 194 and 195:
Test Object Preparation 3. Map inpu
Page 196 and 197:
Instrumentation
Page 198 and 199:
Each branching condition is replace
Page 200 and 201:
Relational predicates are replaced
Page 202 and 203:
1nput: NODE T F 1 0 1 2 10 0 4 20
Page 204 and 205:
The ‘Flag’ Problem
Page 206 and 207:
Program Transformation
Page 208 and 209:
Programs will inevitably have featu
Page 210 and 211:
Nesting Phil McMinn, David Binkley
Page 212 and 213:
Testability Transformation Note tha
Page 214 and 215:
Nesting & Local Optima
Page 216 and 217:
Nesting & Local Optima
Page 218 and 219:
Results - Industrial & Open source
Page 220 and 221:
Dependent & Independent Predicates
Page 222:
Independent and some dependent pred
Page 225 and 226:
we are testing to cover structure .
Page 227 and 228:
we are testing to cover structure .
Page 229 and 230:
Mark Harman, Youssef Hassoun, Kiran
Page 231 and 232:
Mark Harman, Youssef Hassoun, Kiran
Page 233 and 234:
Effect of Reduction -100,000 ... 10
Page 235 and 236:
Effect of Reduction -100,000 ... 10
Page 237 and 238:
Variable Dependency Analysis
Page 239 and 240:
Variable Dependency Analysis
Page 241 and 242:
Effect on Random Testing -49 ... 50
Page 243 and 244:
Results with Random Testing
Page 245 and 246:
Effect on AVM Saves probe moves (an
Page 247 and 248:
Effect on ET Saves mutations on irr
Page 249 and 250:
Conclusions for Input Domain Reduct
Page 251 and 252:
Empirical Study Bibclean Defroster
Page 253 and 254:
Wins for the AVM 100 90 80 Success
Page 255 and 256:
When does the AVM win fitness input
Page 257 and 258:
When does ET win The branches in qu
Page 259 and 260:
Schemata Subsets of useful genes e.
Page 261 and 262:
Schemata 1**1 *11* 1111 crossover o
Page 263 and 264:
The Genetic Algorithm Royal Road S1
Page 265 and 266:
When Crossover Helps Executes the t
Page 267 and 268:
When Crossover Helps Executes the t
Page 269 and 270:
Royal Roads Investigations into Cro
Page 271 and 272:
Crossover of good schemata {(a, b,
Page 273 and 274:
Crossover of good schemata building
Page 275 and 276:
Crossover of good schemata {(a, b,
Page 277 and 278:
What types of program and program s
Page 279 and 280:
Crossover - Conclusions 1. Large nu
Page 281 and 282:
Crossover - Conclusions 1. Large nu
Page 283 and 284:
Future directions...
Page 285 and 286:
Human Oracle Cost Typically the res
Page 287 and 288:
Test data generation and human orac
Page 289 and 290:
Test data generation and human orac
Page 291 and 292:
Calendar program Takes two dates (r
Page 293 and 294:
Seeding knowledge Programmer test c
Page 295 and 296:
In what ways can operational profil
Page 297 and 298:
Identifier names Give clues to the
Page 299 and 300:
Test Data Re-use
Page 301 and 302:
Program similarity and test data re
Page 303 and 304:
web: http://www.dcs.shef.ac.uk/~phi
show all

slides available - FBK | SE

Create successful ePaper yourself

Delete template?

Save as template?