计算机应用 ›› 2010, Vol. 30 ›› Issue (10): 2730-2734.
• 软件过程技术与先进计算 • 上一篇 下一篇
姜林1,艾波2,漆涛2
收稿日期:
修回日期:
发布日期:
出版日期:
通讯作者:
Received:
Revised:
Online:
Published:
摘要： 利用分形理论对软件复杂度进行研究，给出盒子及程序分形复杂度的定义，进一步给出了算法思想和计算方法，并通过实例说明程序具有分形特征——标度不变性。在此基础上，对一些程序的分形复杂度进行了计算，并通过进一步的分析表明所得数值在某种情况下可以反映出程序在结构上的复杂程度，其度量结果是比较有效的。
关键词: 分形, 盒子, 软件复杂度, 分形复杂度, 标度不变性
Abstract: Software complexity was studied with fractal theory, the definition of box and fractal complexity was given, and then a related algorithm was proposed. Some examples showed that some programs have fractal attribute, called scale invariance. On this basis, several existing programs were tested. The further analysis results show that, under certain conditions, it is effective for the proposed algorithm to calculate the complexity of a program.
Key words: fractal, box, software complexity, fractal complexity, scale invariance
中图分类号:
TP311.1
姜林 艾波 漆涛. 分形理论在软件复杂度中的应用[J]. 计算机应用, 2010, 30(10): 2730-2734.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://www.joca.cn/CN/
http://www.joca.cn/CN/Y2010/V30/I10/2730
