Fast Abstracts
Fast abstracts feature novel ideas that are not yet fully developed or validated, are of up to 6 pages in length, and are published here on the symposium website:
- Mustafa Bozkurt and Mark Harman
Optimised Realistic Test Input Generation - Peter M. Kruse and Kiran Lakhotia
Multi Objective Algorithms for Automated Generation of Combinatorial Test Cases with the Classification Tree Method - Roberto E. Lopez-Herrejon and Alexander Egyed
Searching the Variability Space to Fix Model Inconsistencies: A Preliminary Assessment - Camila L. B. Maia, Thiago N. Ferreira, Fabricio G. Freitas and Jerffeson T. Souza
An Ant Colony Based Algorithm for Test Case Prioritization with Precedence - Liang Yalan, Changhai Nie, Jonathan M. Kauffman, Gregory M. Kapfhammer and Hareton Leung
Empirically Identifying the Best Genetic Algorithm for Covering Array Generation - Shin Yoo
SBSE As Gaming
