Change search
ReferencesLink to record
Permanent link

Direct link
Evaluating cyclomatic complexity on functional JavaScript
Linnaeus University, Faculty of Technology, Department of Computer Science.
Linnaeus University, Faculty of Technology, Department of Computer Science.
2016 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Bugs in software is a very common problem, code reviews can help to catch

bugs early on and detect which code is the most complex and may introduce

bugs but when the code base is very large it can be costly to review all the

code. Cyclomatic complexity can be used to give an indication of how complex

the system source code is and help the developers to select which code they

should review. But when measuring cyclomatic complexity on code written

according to the functional paradigm, McCabe’s formula will not be sufficient

since it is a formula most suitable for imperative code. Therefore we are

making adaptations to a formula suited for pure functional languages in order

to fit functional JavaScript. We are using an inductive empirical quantitative

measurement method to calculate cyclomatic complexity on a directed graph

implementation in order to define adaptations for functional JavaScript. Our

results show a working adapted version of the formula. We have measured on

a graph implemented in Haskell and on a corresponding functional JavaScript

version which results in a cyclomatic complexity difference at only 0.375.

Place, publisher, year, edition, pages
2016.
Keyword [en]
Software metrics, McCabe’s cyclomatic complexity, functional programming, imperative programming, JavaScript, Haskell, functional JavaScript, measuring cyclomatic complexity on JavaScript, measuring cyclomatic complexity on the functional paradigm.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:lnu:diva-55794OAI: oai:DiVA.org:lnu-55794DiVA: diva2:955893
Supervisors
Examiners
Available from: 2016-08-29 Created: 2016-08-26 Last updated: 2016-08-29Bibliographically approved

Open Access in DiVA

fulltext(811 kB)7 downloads
File information
File name FULLTEXT01.pdfFile size 811 kBChecksum SHA-512
e54eb5435b3a4f0707f608d3da1eb6de14dfeb65294515b7171d3a7dc5042f88a8dec406fea98203b05218d5a65446e040de8122a2e01b33ca108e9c718d9c95
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Håkansson, JesperBadran, Sherief
By organisation
Department of Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 7 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 22 hits
ReferencesLink to record
Permanent link

Direct link