Högskolan i Skövde

his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • 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
Identifying Complex Functions: By Investigating Various Aspects of Code Complexity
Department of Computer Science and Engineering, Chalmers, Gothenburg, Sweden / University of Gothenburg, Sweden.
Department of Computer Science and Engineering, Chalmers, Gothenburg, Sweden / University of Gothenburg, Sweden.
Ericsson, Gothenburg, Sweden.
AB Volvo, Gothenburg, Sweden.
Show others and affiliations
2015 (English)In: Proceedings of 2015 Science and Information Conference (SAI): July 28-30, 2015, London, United Kingdom, IEEE Press, 2015, p. 879-888Conference paper, Published paper (Refereed)
Resource type
Text
Abstract [en]

The complexity management of software code has become one of the major problems in software development industry. With growing complexity the maintenance effort of code increases. Moreover, various aspects of complexity create difficulties for complexity assessment. The objective of this paper is to investigate the relationships of various aspects of code complexity and propose a method for identifying the most complex functions. We have conducted an action research project in two software development companies and complemented it with a study of three open source products. Four complexity metrics are measured, and their nature and mutual influence are investigated. The results and possible explanations are discussed with software engineers in industry. The results show that there are two distinguishable aspects of complexity of source code functions: Internal and outbound complexities. Those have an inverse relationship. Moreover, the product of them does not seem to be greater than a certain limit, regardless of software size. We present a method that permits identification of most complex functions considering the two aspects of complexities. The evaluation shows that the use of the method is effective in industry: It enables identification of 0.5% most complex functions out of thousands of functions for reengineering.

Place, publisher, year, edition, pages
IEEE Press, 2015. p. 879-888
Keywords [en]
code, complexity, management, risk, trade-off
National Category
Computer and Information Sciences Computer Sciences Software Engineering
Identifiers
URN: urn:nbn:se:his:diva-12796DOI: 10.1109/SAI.2015.7237246ISI: 000380448800122Scopus ID: 2-s2.0-84957825136ISBN: 978-1-4799-8547-0 (electronic)ISBN: 978-1-4799-8548-7 (print)ISBN: 978-1-4799-8546-3 (electronic)OAI: oai:DiVA.org:his-12796DiVA, id: diva2:953920
Conference
Science and Information Conference (SAI), London, United Kingdom, July 28-30, 2015
Available from: 2016-08-19 Created: 2016-08-19 Last updated: 2020-08-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Hansson, Jörgen

Search in DiVA

By author/editor
Hansson, Jörgen
By organisation
School of InformaticsThe Informatics Research Centre
Computer and Information SciencesComputer SciencesSoftware Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 632 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • 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