%0 Conference Proceedings
%T Search-Based Testing for Embedded Telecom Software with Complex Input Structures
%+ Swedish ICT (SICS)
%+ Mälardalen University (MDH)
%+ Ericsson [Stockholm]
%+ Karlstad University [Sweden]
%A Doganay, Kivanc
%A Eldh, Sigrid
%A Afzal, Wasif
%A Bohlin, Markus
%Z Part 4: Short Contributions
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 26th IFIP International Conference on Testing Software and Systems (ICTSS)
%C Madrid, Spain
%Y Mercedes G. Merayo
%Y Edgardo Montes Oca
%I Springer
%3 Testing Software and Systems
%V LNCS-8763
%P 205-210
%8 2014-09-23
%D 2014
%R 10.1007/978-3-662-44857-1_17
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01405289/document
%2 https://inria.hal.science/hal-01405289/file/978-3-662-44857-1_17_Chapter.pdf
%L hal-01405289
%U https://inria.hal.science/hal-01405289
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-LNCS-8763
%~ IFIP-ICTSS