A New Complexity Metric for UML Sequence Diagrams

Nevy Kimani Maina, G. M. Muketha, G. Wambugu
{"title":"A New Complexity Metric for UML Sequence Diagrams","authors":"Nevy Kimani Maina, G. M. Muketha, G. Wambugu","doi":"10.5121/ijsea.2023.14102","DOIUrl":null,"url":null,"abstract":"Object-Oriented Programming (OOP) has been promoted as a way to produce high-quality software while increasing developer productivity through code reuse. Software systems and underlying designs get more extensive and more complicated while maintaining a high degree of quality. One of the widely accepted standards for describing software architectures is the UML Sequence Diagram. A sequence diagram depicts the interaction of two-dimensional chart players by showing messages delivered and received between them. This research aims to develop and validate a metric for complexity evaluation in software design architectures through UML Sequence diagrams. The study included design science, which included metric specification, the creation of a measurement tool, and conceptual and factual verification of the metrics. The metrics use diagram-centric complexity measurements shown to be meaningful when used to determine the difficulty of two example sequence diagrams. Furthermore, conceptual affirmation of the stated metrics was achieved through Weyuker's nine characteristics, which demonstrated that they are computationally efficient. The metric was empirically authenticated, and the findings show that measuring the complexity of sequence diagrams is expedient.","PeriodicalId":434551,"journal":{"name":"International Journal of Software Engineering & Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Software Engineering & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/ijsea.2023.14102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Object-Oriented Programming (OOP) has been promoted as a way to produce high-quality software while increasing developer productivity through code reuse. Software systems and underlying designs get more extensive and more complicated while maintaining a high degree of quality. One of the widely accepted standards for describing software architectures is the UML Sequence Diagram. A sequence diagram depicts the interaction of two-dimensional chart players by showing messages delivered and received between them. This research aims to develop and validate a metric for complexity evaluation in software design architectures through UML Sequence diagrams. The study included design science, which included metric specification, the creation of a measurement tool, and conceptual and factual verification of the metrics. The metrics use diagram-centric complexity measurements shown to be meaningful when used to determine the difficulty of two example sequence diagrams. Furthermore, conceptual affirmation of the stated metrics was achieved through Weyuker's nine characteristics, which demonstrated that they are computationally efficient. The metric was empirically authenticated, and the findings show that measuring the complexity of sequence diagrams is expedient.
UML序列图的一种新的复杂度度量
面向对象编程(OOP)作为一种生产高质量软件的方法而得到了推广,同时通过代码重用提高了开发人员的生产力。软件系统和底层设计在保持高质量的同时变得越来越广泛和复杂。一个被广泛接受的描述软件架构的标准是UML序列图。序列图通过显示它们之间传递和接收的消息来描述二维图表玩家之间的交互。本研究旨在通过UML序列图开发并验证软件设计体系结构中复杂性评估的度量。该研究包括设计科学,它包括度量规范、度量工具的创建,以及度量的概念和事实验证。当用于确定两个示例序列图的难度时,度量标准使用以图为中心的复杂性度量是有意义的。此外,通过Weyuker的九个特征来实现对所述指标的概念肯定,这表明它们是计算效率高的。该度量经过了经验验证,结果表明度量序列图的复杂性是方便的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信