A qualitative method for measuring the structural complexity of software systems based on complex networks

Yutao Ma, K. He, Dehui Du
{"title":"A qualitative method for measuring the structural complexity of software systems based on complex networks","authors":"Yutao Ma, K. He, Dehui Du","doi":"10.1109/APSEC.2005.14","DOIUrl":null,"url":null,"abstract":"How can we effectively measure the complexity of a modern complex software system has been a challenge for software engineers. Complex networks as a branch of complexity science are recently studied across many fields of science, and many large-scale software systems are proved to represent an important class of artificial complex networks. So, we introduce the relevant theories and methods of complex networks to analyze the topological/structural complexity of software systems, which is the key to measuring software complexity. Primarily, basic concepts, operational definitions, and measurement units of all parameters involved are presented respectively. Then, we propose a qualitative measure based on the structure entropy that measures the amount of uncertainty of the structural information, and on the linking weight that measures the influences of interactions or relationships between components of software systems on their overall topologies/structures. Eventually, some examples are used to demonstrate the feasibility and effectiveness of our method.","PeriodicalId":359862,"journal":{"name":"12th Asia-Pacific Software Engineering Conference (APSEC'05)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"48","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th Asia-Pacific Software Engineering Conference (APSEC'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSEC.2005.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 48

Abstract

How can we effectively measure the complexity of a modern complex software system has been a challenge for software engineers. Complex networks as a branch of complexity science are recently studied across many fields of science, and many large-scale software systems are proved to represent an important class of artificial complex networks. So, we introduce the relevant theories and methods of complex networks to analyze the topological/structural complexity of software systems, which is the key to measuring software complexity. Primarily, basic concepts, operational definitions, and measurement units of all parameters involved are presented respectively. Then, we propose a qualitative measure based on the structure entropy that measures the amount of uncertainty of the structural information, and on the linking weight that measures the influences of interactions or relationships between components of software systems on their overall topologies/structures. Eventually, some examples are used to demonstrate the feasibility and effectiveness of our method.
一种基于复杂网络的软件系统结构复杂性的定性测量方法
如何有效地度量现代复杂软件系统的复杂性一直是软件工程师面临的挑战。复杂网络作为复杂性科学的一个分支,近年来在许多科学领域得到了广泛的研究,许多大型软件系统被证明是一类重要的人工复杂网络。因此,我们引入复杂网络的相关理论和方法来分析软件系统的拓扑/结构复杂性,这是测量软件复杂性的关键。首先,分别介绍了各参数的基本概念、操作定义和测量单位。然后,我们提出了一种基于结构熵的定性度量,它测量了结构信息的不确定性,以及链接权,它测量了软件系统组件之间的相互作用或关系对其整体拓扑/结构的影响。最后,通过算例验证了该方法的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信