TY  - GEN
N2  - We present a search based testing system that automatically explores the space of all possible GUI event interleavings. Search guides our system to novel crashing sequences using Levenshtein distance and minimises the resulting fault-revealing UI sequences in a post-processing hill climb. We report on the application of our system to the SSBSE 2014 challenge program, Pidgin. Overall, our Pidgin Crasher found 20 different events that caused 2 distinct kinds of bugs, while the event sequences that caused them were reduced by 84% on average using our minimisation post processor.
ID  - discovery1433998
UR  - http://dx.doi.org/10.1007/978-3-319-09940-8_21
EP  - 258
T3  - Lecture Notes in Computer Science
Y1  - 2014///
TI  - Pidgin Crasher: Searching for Minimised Crashing GUI Event Sequences
CY  - Switzerland
AV  - public
A1  - Dan, H
A1  - Harman, M
A1  - Krinke, J
A1  - Li, L
A1  - Marginean, A
A1  - Wu, F
PB  - Springer International
N1  - The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-09940-8_21?
SP  - 253
ER  -