TY - GEN
T1 - Towards a Formal Approach to Defining and Computing the Complexity of Component Based Software
AU - Zhao, Yongxin
AU - Zhang, Xiujuan
AU - Shi, Ling
AU - Zeng, Gan
AU - Sheng, Feng
AU - Liu, Shuang
N1 - Publisher Copyright:
©,2019 IEEE.
PY - 2019/12
Y1 - 2019/12
N2 - With the rapid development of software engineering and the widely adoption of software systems in various domains,the requirement for software systems is becoming more and more complex,which results in very complex software systems. Motivated by the principle of divide and conquer,component based software development is an effective way of managing the complexity in software development. In this paper,we propose a calculus to formally describe the functional and performance specification of component based software and provide formal semantics for the proposed calculus. Then we provide a method to measure the dynamic complexity of software compositions based on the proposed calculus. Finally,we define a set of algebraic laws to manifest the complexity relations between different functionally equivalent components. We conduct a case study with a real software system and the results show that our method is able to calculate the dynamic complexity of component based systems,and the complexity can be reduced based on our algebraic laws.
AB - With the rapid development of software engineering and the widely adoption of software systems in various domains,the requirement for software systems is becoming more and more complex,which results in very complex software systems. Motivated by the principle of divide and conquer,component based software development is an effective way of managing the complexity in software development. In this paper,we propose a calculus to formally describe the functional and performance specification of component based software and provide formal semantics for the proposed calculus. Then we provide a method to measure the dynamic complexity of software compositions based on the proposed calculus. Finally,we define a set of algebraic laws to manifest the complexity relations between different functionally equivalent components. We conduct a case study with a real software system and the results show that our method is able to calculate the dynamic complexity of component based systems,and the complexity can be reduced based on our algebraic laws.
KW - Algebraic laws
KW - Complexity computation
KW - Complexity semantics
KW - Software complexity
UR - https://www.scopus.com/pages/publications/85078105232
U2 - 10.1109/APSEC48747.2019.00052
DO - 10.1109/APSEC48747.2019.00052
M3 - 会议稿件
AN - SCOPUS:85078105232
T3 - Proceedings - Asia-Pacific Software Engineering Conference, APSEC
SP - 331
EP - 338
BT - Proceedings - 2019 26th Asia-Pacific Software Engineering Conference, APSEC 2019
PB - IEEE Computer Society
T2 - 26th Asia-Pacific Software Engineering Conference, APSEC 2019
Y2 - 2 December 2019 through 5 December 2019
ER -