Skip to Main content Skip to Navigation
Conference papers

Search-Based Testing for Embedded Telecom Software with Complex Input Structures

Abstract : 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.
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, November 29, 2016 - 4:43:06 PM
Last modification on : Monday, June 24, 2019 - 10:08:02 AM
Long-term archiving on: : Monday, March 27, 2017 - 9:29:22 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Kivanc Doganay, Sigrid Eldh, Wasif Afzal, Markus Bohlin. Search-Based Testing for Embedded Telecom Software with Complex Input Structures. 26th IFIP International Conference on Testing Software and Systems (ICTSS), Sep 2014, Madrid, Spain. pp.205-210, ⟨10.1007/978-3-662-44857-1_17⟩. ⟨hal-01405289⟩



Record views


Files downloads