Automatic Measurement of Source Code Complexity
Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
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. , 93 p.
Technology, code complexity, code analysis, software metrics, code metrics, code measurement
Teknik, code complexity, code analysis, software metrics, code metrics, code measurement
IdentifiersURN: urn:nbn:se:ltu:diva-46648Local ID: 4454d74b-4e81-4b3b-b98c-b278c5949db4OAI: oai:DiVA.org:ltu-46648DiVA: diva2:1019963
Subject / course
Student thesis, at least 30 credits
Computer Science and Engineering, master's level
Validerat; 20110525 (anonymous)2016-10-042016-10-04Bibliographically approved