Behavioral Complexity Quantification (Becom-Q)

Dionisio de Niz, Min-Young Nam, Julien Delange
{"title":"Behavioral Complexity Quantification (Becom-Q)","authors":"Dionisio de Niz, Min-Young Nam, Julien Delange","doi":"10.1145/2897695.2897700","DOIUrl":null,"url":null,"abstract":"Todays' embedded and cyber-physical systems (CPS) rely heavily on complex software functions. While part of this complexity is unavoidable and caused by a growing number of functions (intrinsic complexity), another part is related to inappropriate design and development methods (called avoidable complexity). Indeed the early removal of avoidable complexity is one of the key challenges of software-intensive systems.Over the years, several methods have been proposed to identify and quantify software complexity. However, current complexity measures rely mostly on the analysis of software structures and are not good predictors of software complexity and potential design flaws. This motivates the needs of new metrics of software complexity. In this paper, we describe a new complexity metric based on the analysis of behavioral aspects of software we call Behavioral Analysis Quantication or Becom-Q for short.Specically, we use advances in model-checking and model counting to quantify all possible behaviors that a software function may exhibit and use this quantication to model software complexity.","PeriodicalId":185963,"journal":{"name":"2016 IEEE/ACM 7th International Workshop on Emerging Trends in Software Metrics (WETSoM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE/ACM 7th International Workshop on Emerging Trends in Software Metrics (WETSoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2897695.2897700","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Todays' embedded and cyber-physical systems (CPS) rely heavily on complex software functions. While part of this complexity is unavoidable and caused by a growing number of functions (intrinsic complexity), another part is related to inappropriate design and development methods (called avoidable complexity). Indeed the early removal of avoidable complexity is one of the key challenges of software-intensive systems.Over the years, several methods have been proposed to identify and quantify software complexity. However, current complexity measures rely mostly on the analysis of software structures and are not good predictors of software complexity and potential design flaws. This motivates the needs of new metrics of software complexity. In this paper, we describe a new complexity metric based on the analysis of behavioral aspects of software we call Behavioral Analysis Quantication or Becom-Q for short.Specically, we use advances in model-checking and model counting to quantify all possible behaviors that a software function may exhibit and use this quantication to model software complexity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
行为复杂性量化(become - q)
当今的嵌入式和网络物理系统(CPS)严重依赖于复杂的软件功能。虽然这种复杂性的一部分是不可避免的,并且是由越来越多的功能(固有复杂性)引起的,但另一部分与不适当的设计和开发方法有关(称为可避免的复杂性)。事实上,尽早消除可避免的复杂性是软件密集型系统的主要挑战之一。多年来,已经提出了几种方法来识别和量化软件复杂性。然而,当前的复杂性度量主要依赖于对软件结构的分析,不能很好地预测软件复杂性和潜在的设计缺陷。这激发了对新的软件复杂性度量标准的需求。在本文中,我们描述了一种新的基于软件行为方面分析的复杂性度量,我们称之为行为分析量化,简称为become - q。具体地说,我们使用模型检查和模型计数方面的进展来量化软件功能可能表现出的所有可能的行为,并使用这种量化来建模软件复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Metrics for Feature-Oriented Programming Measuring High and Low Priority Defects on Traditional and Mobile Open Source Software On the Maintenance Complexity of Makefiles A Metric Suite Proposal for Logical Dependency Behavioral Complexity Quantification (Becom-Q)
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1