Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Search-based Testing for Embedded Telecommunication Software with Complex Input Structures: An Industrial Case Study
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. (IS (Embedded Systems))ORCID iD: 0000-0003-2234-1255
Ericsson AB, Kista, Sweden.ORCID iD: 0000-0002-5070-9312
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0003-0611-2655
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. (IS (Embedded Systems))ORCID iD: 0000-0003-1597-6738
2014 (English)Report (Other academic)
Abstract [en]

In this paper, we discuss the application of search-based software test-ing techniques for unit level testing of a real-world telecommunication middleware at Ericsson. Input data for the system under test consists of nested data structures, and includes non-trivial variables such as unini-tialized pointers. Our current implementation analyzes the existing test cases to discover how to handle pointers, set global system parameters, and any other setup code that needs to run before the actual test case. 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 as a baseline of performance with respect to e˙ectiveness, measured as branch coverage, and eÿciency, measured as number of executions needed. Diÿculties arising from the specialized execution environment and the adaptations for handling these problems are also discussed.

Place, publisher, year, edition, pages
SICS Swedish ICT , 2014.
Series
SICS Technical Report, ISSN 1100-3154 ; T2014:03
National Category
Computer Science
Identifiers
URN: urn:nbn:se:mdh:diva-25946OAI: oai:DiVA.org:mdh-25946DiVA: diva2:746641
Available from: 2014-09-14 Created: 2014-09-14 Last updated: 2015-02-03Bibliographically approved
In thesis
1. Applications of Optimization Methods in Industrial Maintenance Scheduling and Software Testing
Open this publication in new window or tab >>Applications of Optimization Methods in Industrial Maintenance Scheduling and Software Testing
2014 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

As the world is getting more and more competitive, efficiency has become a bigger concern than ever for many businesses. Certain efficiency concerns can naturally be expressed as optimization problems, which is a well studied field in the academia. However, optimization algorithms are not as widely employed in industrial practice as they could. There are various reasons for the lack of widespread adoption. For example, it can be difficult or even impossible for non-experts to formulate a detailed mathematical model of the problem. On the other hand, a scientist usually does not have a deep enough understanding of critical business details, and may fail to capture enough details of the real- world phenomenon of concern. While a model at an arbitrary abstraction level is often good enough to demonstrate the optimization approach, ignoring relevant aspects can easily render the solution impractical for the industry. This is an important problem, because applicability concerns hinder the possible gains that can be achieved by using the academic knowledge in industrial practice. In this thesis, we study the challenges of industrial optimization problems in the form of four case studies at four different companies, in the domains of maintenance schedule optimization and search-based software testing. Working with multiple case studies in different domains allows us to better understand the possible gains and practical challenges in applying optimization methods in an industrial setting. Often there is a need to trade precision for applicability, which is typically very context dependent. Therefore, we compare our results against base values, e.g., results from simpler algorithms or the state of the practice in the given context, where applicable. Even though we cannot claim that optimization methods are applicable in all situations, our work serves as an empirical evidence for the usability of optimization methods for improvements in different industrial contexts. We hope that our work can encourage the adoption of optimization techniques by more industrial practitioners.

Place, publisher, year, edition, pages
Västerås: Mälardalen University, 2014
Series
Mälardalen University Press Licentiate Theses, ISSN 1651-9256 ; 180
National Category
Computer Science
Research subject
Computer Science
Identifiers
urn:nbn:se:mdh:diva-25944 (URN)978-91-7485-163-2 (ISBN)
Presentation
2014-10-14, R3-131, Mälardalens högskola, Västerås, 13:30 (English)
Opponent
Supervisors
Available from: 2014-09-15 Created: 2014-09-14 Last updated: 2014-10-08Bibliographically approved

Open Access in DiVA

No full text

Other links

http://soda.swedish-ict.se/5696/

Search in DiVA

By author/editor
Doganay, KivancEldh, SigridAfzal, WasifBohlin, Markus
By organisation
Embedded Systems
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 200 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf