Search-Based Testing for Embedded Telecom Software with Complex Input Structures
2014 (English)In: TESTING SOFTWARE AND SYSTEMS (ICTSS 2014), Springer Berlin/Heidelberg, 2014, 205-210 p.Conference paper (Refereed)Text
In this paper, we discuss the application of search-based software testing techniques for unit level testing of a real-world telecommunication middleware at Ericsson. Our current implementation analyzes the existing test cases to handle non-trivial variables such as uninitialized pointers, and to discover any setup code that needs to run before the actual test case, such as setting global system parameters. Hill climbing (HC) and (1+1) evolutionary algorithm (EA) metaheuristic search algorithms are used to generate input data for branch coverage. We compare HC, (1+1) EA, and random search with respect to effectiveness, measured as branch coverage, and efficiency, measured as number of executions needed. Difficulties arising from the specialized execution environment and the adaptations for handling these problems are also discussed.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2014. 205-210 p.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 8763
Research subject Computer Science
IdentifiersURN: urn:nbn:se:kau:diva-44645ISI: 000378212600017ISBN: 978-3-662-44857-1OAI: oai:DiVA.org:kau-44645DiVA: diva2:951898
26th IFIP WG 6.1 International Conference on Testing Software and Systems (ICTSS), SEP 23-25, 2014, Madrid, SPAIN