dc.contributor.author | Michael A, Olatunji | |
dc.contributor.author | Oladele, Rufus O. | |
dc.contributor.author | Bajeh, Amos O | |
dc.date.accessioned | 2022-11-16T03:57:26Z | |
dc.date.available | 2022-11-16T03:57:26Z | |
dc.date.issued | 2017-01-01 | |
dc.identifier.issn | 2408-8498 | |
dc.identifier.issn | 1818-5878 | |
dc.identifier.uri | http://dspace.daffodilvarsity.edu.bd:8080/handle/123456789/8930 | |
dc.description.abstract | This paper aims at investigating the validity of Lehman's Law of Increasing Complexity. Two metrics namely cyclomatic complexity and interface complexity were defined to capture increasing complexity. The goal was to verify if these metrics can be used to validate Lehman’s law of increasing complexity. Empirical analysis was performed using historical data collected on four evolving Open Source Systems (OSS). Results show that the considered Lehman’s law is partially supported by the collected data and the metrics. In particular, empirical results reveal that: total cyclomatic complexity and total interface complexity are increasing from version to version; average cyclomatic complexity and average interface complexity either declines or increases within a very short range; and function interface complexity hardly decline in evolving OSS. Also, the addition of low complex functions reduce cyclomatic complexity in evolving OSS but does little in reducing function interface complexity. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Daffodil International University | en_US |
dc.subject | Software Engineering | en_US |
dc.subject | Open Source Software | en_US |
dc.title | Empirical Study of Cyclomatic Complexity and Interface Complexity of Evolving Open Source Systems | en_US |
dc.type | Other | en_US |