Sökning: id:"swepub:oai:DiVA.org:his-12796" >
Identifying Complex...
-
Antinyan, Vard,1984Gothenburg University,Göteborgs universitet,Institutionen för data- och informationsteknik (GU),Department of Computer Science and Engineering (GU),Department of Computer Science and Engineering, Chalmers, Gothenburg, Sweden / University of Gothenburg, Sweden
(författare)
Identifying Complex Functions : By Investigating Various Aspects of Code Complexity
- Artikel/kapitelEngelska2015
Förlag, utgivningsår, omfång ...
-
IEEE Press,2015
-
printrdacarrier
Nummerbeteckningar
-
LIBRIS-ID:oai:DiVA.org:his-12796
-
ISBN:9781479985470
-
https://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-12796URI
-
https://doi.org/10.1109/SAI.2015.7237246DOI
-
https://research.chalmers.se/publication/214200URI
-
https://gup.ub.gu.se/publication/214200URI
Kompletterande språkuppgifter
-
Språk:engelska
-
Sammanfattning på:engelska
Ingår i deldatabas
Klassifikation
-
Ämneskategori:ref swepub-contenttype
-
Ämneskategori:kon swepub-publicationtype
Anmärkningar
-
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.
Ämnesord och genrebeteckningar
Biuppslag (personer, institutioner, konferenser, titlar ...)
-
Staron, Miroslaw,1977Gothenburg University,Göteborgs universitet,Institutionen för data- och informationsteknik (GU),Department of Computer Science and Engineering (GU),Department of Computer Science and Engineering, Chalmers, Gothenburg, Sweden / University of Gothenburg, Sweden(Swepub:gu)xstmir
(författare)
-
Derehag, JesperEricsson, Gothenburg, Sweden,Telefonaktiebolaget L M Ericsson
(författare)
-
Runsten, MattiasAB Volvo, Gothenburg, Sweden,Volvo Group,Högskolan i Skövde,University of Skövde
(författare)
-
Wikström, ErikEricsson, Gothenburg, Sweden,Telefonaktiebolaget L M Ericsson
(författare)
-
Meding, WilhelmEricsson, Gothenburg, Sweden,Telefonaktiebolaget L M Ericsson
(författare)
-
Henriksson, AndersAB Volvo, Gothenburg, Sweden,Chalmers tekniska högskola,Chalmers University of Technology
(författare)
-
Hansson, JörgenHögskolan i Skövde,Institutionen för informationsteknologi,Forskningscentrum för Informationsteknologi,Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)jorhans
(författare)
-
Göteborgs universitetInstitutionen för data- och informationsteknik (GU)
(creator_code:org_t)
Sammanhörande titlar
-
Ingår i:Proceedings of 2015 Science and Information Conference (SAI): IEEE Press, s. 879-888978147998547097814799854879781479985463
Internetlänk
Hitta via bibliotek
Till lärosätets databas