Research Papers - Dept of Software Engineering

Permanent URI for this collectionhttps://rda.sliit.lk/handle/123456789/1022

Browse

Filters

2012 - 20132

Advanced Search

Filter by

Settings

Author: search.filters.author.De Silva, D. ISubject: search.filters.subject.Applicability

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    PublicationEmbargo
    Applicability of Weyuker's properties using three complexity metrics
    (IEEE, 2013-04-26) De Silva, D. I; Kodagoda, N
    Although a number of complexity metrics have been proposed, only a few studies have been conducted to compare those proposed metrics to find the most effective and comprehensive metric. In general, to find the effectiveness and the comprehensiveness of a metric Weyuker's nine properties are used. However determining whether a complexity metric satisfies some theoretical framework is not enough to determine the effectiveness and comprehensiveness of that particular metric. Thus, this empirical study was conducted to find the effectiveness and comprehensiveness of three complexity metrics - McCabe's cyclomatic complexity, Halstead's software science and Shao and Wangs' cognitive functional size using the help of thirty software programmers with five or more years of working experience and thereby demonstrate the applicability of Weyuker's properties.
  • Thumbnail Image
    PublicationEmbargo
    Applicability of three complexity metrics
    (IEEE, 2012-12-12) De Silva, D. I; Kodagoda, N; Perera, H
    Over the years a number of complexity metrics have been proposed. However, there have been only a few studies conducted to compare those proposed metrics in terms of their practical applicability. The few researches that have been conducted to assess the applicability of a complexity metric have also used the five properties proposed by Briand et al. However determining whether a complexity measure satisfies some theoretical complexity properties is not a reliable method of determining the practical applicability of it. Thus, the main intent of this study was to compare three proposed code complexity metrics: McCabe's cyclomatic complexity, Halstead's software science and Shao and Wangs' cognitive functional size and identify which metric is the most suitable metric that can be used in the current state of the art with the help of thirty programmers. To conduct this empirical study ten freely available java programs were used as the base. From this study it was identified that Shao and Wangs' cognitive functional size is the best complexity metric that can be used in the real world.