System disruptions
We are currently experiencing disruptions on the search portals due to high traffic. We are working to resolve the issue, you may temporarily encounter an error message.
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
Automatic Measurement of Source Code Complexity
2011 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

The aim of this master thesis is to explore the area of software metrics and to identify software metrics related to the code complexity. In this thesis, thorough study is made to determine whether or not the automatic measurement of source code complexity is possible. A tool for automatic measurement of source code complexity is implemented during this thesis to prove the idea that the automatic measurement is achievable. This report summaries the theory about software metrics, purpose and classification of the metrics, and the areas where metrics can be helpful to use. Detail description about some selected metrics (like Cyclomatic Complexity and Halstead metrics) is also a part of this report. Three core requirements of this thesis are: 1) Measurement of code complexity for the code written in C. 2) Measurement should perform automatically on the code base and on a regular basis for new code releases. 3) Run on Solaris. Some of the existing complexity measurement tools (open-source and commercial) are evaluated in this thesis. QA-C is an existing commercially available tool for the code complexity of C code. The tool implemented in this thesis uses QA-C as a foundation for analyzing C code on Solaris. Web interfaces are designed to present the results of code complexity measurement.

Place, publisher, year, edition, pages
2011. , p. 93
Keywords [en]
Technology, code complexity, code analysis, software metrics, code metrics, code measurement
Keywords [sv]
Teknik, code complexity, code analysis, software metrics, code metrics, code measurement
Identifiers
URN: urn:nbn:se:ltu:diva-46648Local ID: 4454d74b-4e81-4b3b-b98c-b278c5949db4OAI: oai:DiVA.org:ltu-46648DiVA, id: diva2:1019963
Subject / course
Student thesis, at least 30 credits
Educational program
Computer Science and Engineering, master's level
Examiners
Note
Validerat; 20110525 (anonymous)Available from: 2016-10-04 Created: 2016-10-04Bibliographically approved

Open Access in DiVA

fulltext(1534 kB)14246 downloads
File information
File name FULLTEXT02.pdfFile size 1534 kBChecksum SHA-512
c85524a0166a44b76d997427b37d2b4d4f129bb2fa6be8b000d742f871faea6ab34d392d783c8286d9b14f70d4466c22fce4ef6cca5d3f1d730d6fb7623303e9
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Bhatti, Hassan Raza

Search outside of DiVA

GoogleGoogle Scholar
Total: 14248 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

urn-nbn

Altmetric score

urn-nbn
Total: 3214 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