Home» Research» Report

Home» Research» Report

TITLE: The Future of Search-Based Testing
TIME: 9:00, 10/6/2015
LOCATION: Meetring room of CIST
SPEAKER: Phil Mcminn


    Initial work on Search-Based Software Testing (SBST) began in the 70s and witnessed an explosion of work beginning in the early 2000s, with  a particular focus on generating inputs for structural coverage. There  are now a plethora of techniques for successfully generating test  cases for structural coverage, however, many of which do not require  search-based techniques -- for example, Dynamic Symbolic Execution. So  what now for SBST? This talk will look into future directions for  SBST, including: how can SBST be used to drive testing of the complete  applications, e.g. those involving databases? How can SBST be used to  generate realistic tests? Can SBST be used to automate the testing of  more modern concerns, such as energy testing?  


    Phil McMinn is a Reader (Associate Professor) in Software Engineering  in the Department of Computer Science at the University of Sheffield.  His interest in Search-Based Software Testing (SBST) began with his  PhD in collaboration with DaimlerChrysler, where he used evolutionary  search to solve problems in test data generation for embedded  automotive controllers. He has since gone on to publish over 50 papers  on the subject of search-based testing and/or the application of  metaheuristic search-based algorithms to software engineering  problems. His 2004 survey paper has received over 900 citations, and  he has worked on several UK funded research projects to work further  on SBST topics.  
| |