![]() |
| |||||||||||||||
SBST 2012 : 5th International Workshop on Search-Based Software Testing | |||||||||||||||
Link: http://www.cs.ucl.ac.uk/staff/K.Lakhotia/sbst2012/ | |||||||||||||||
| |||||||||||||||
Call For Papers | |||||||||||||||
Call for Papers: 5th International Workshop on Search-Based Software Testing @ ICST 2012 IEEE International Conference on Testing, Verification and Validation 17-21st April 2012, Montreal, Canada
IMPORTANT DATES Submission Deadline: 3rd February 2012 Notification Date: 27th February 2012 Camera Ready: 26th March 2012 ICST 2012: 17-21st April 2012 WEBSITE http://www.cs.ucl.ac.uk/staff/K.Lakhotia/sbst2012/ http://twitter.com/SBST2012 OTHER INFORMATION Search-based software testing is the use of random or directed search techniques (hill climbing, genetic algorithms etc.) to address problems in the software testing and verification and validation domain. There has been an explosion of activity in the search-based software testing field of late, particularly on test data generation. Recent work has also focused on other aspects such as model-based testing, real-time testing, interaction testing, testing of service-oriented architectures, test case prioritization and generation of whole tests (not only test data). Researchers and practitioners are invited to submit full papers (10 pages) to the workshop, describing original research, experience or tools. We will also welcome extended abstracts (4 pages) with new results (that may not yet have empirical support), position papers or far-out ideas. Extended abstracts can also be written to describe testing problems for which we can find search-based solutions during the workshop. We will have a poster session where authors of extended abstracts get feedback, but we will also discuss relevant extended abstracts in the main session. Papers should address a problem in the software testing and/or verification and validation domain and should approach the solution to the problem using a search strategy. Search-based techniques are taken to include (but are not limited to) random search, local search (e.g. hill climbing, simulated annealing and tabu search), evolutionary algorithms (e.g. genetic algorithms, evolution strategies and genetic programming), ant colony optimization and particle swarm optimization. While experimental results are important for research papers, contributions that do not contain results, but rather present new approaches, concepts and/or theory will also be considered. The workshop will have a highly interactive format that encourages discussion about the presented papers and about general themes in search-based software testing. Papers will be published as a proceedings in the IEEE digital library, along with the rest of the proceedings for ICST 2012. CHAIRS General Chair: John Clark, University of York, UK, john.clark@cs.york.ac.uk Program Chairs: Kiran Lakhotia, University College London, UK, k.lakhotia@ucl.ac.uk Wasif Afzal, Blekinge Institute of Technology, Sweden, wasif.afzal@bth.se PRIZE *SBST 2012 offers a prize of 300 Euros for the best paper*. The prize is sponsored by Swell - The Swedish research school in verification and validation (http://swell.weebly.com/). |
|