论文信息 - Complexity metrics for distributed programs

Complexity metrics for distributed programs

This paper proposes some new complexity metrics for distributed programs. The metrics are defined based on graph-theoretical representations for multiple control flows, multiple data flows, and various primary program dependences in distributed programs. They can be used to measure the complexity of a distributed program from various different viewpoints.

Jingde Cheng | Jingde Cheng

[1] Jingde Cheng,et al. Process dependence net of distributed programs and its applications in development of distributed systems , 1993, Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93.

[2] Norman E. Fenton,et al. Software Metrics: A Rigorous Approach , 1991 .

[3] Anas N. Al-Rabadi,et al. A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions , 2004 .

[4] Horst Zuse,et al. Software complexity: Measures and methods , 1990 .

[5] H. E. Dunsmore,et al. Software engineering metrics and models , 1986 .

[6] Kuo-Chung Tai. A program complexity metric based on data flow information in control graphs , 1984, ICSE '84.

[7] Sol M. Shatz. Towards Complexity Metrics for Ada Tasking , 1988, IEEE Trans. Software Eng..

[8] Inmos Limited,et al. OCCAM 2 reference manual , 1988 .

[9] Enrique Ivan Oviedo. Control flow, data flow and program complexity , 1984 .

[10] Jingde Cheng,et al. Compiling programs to their dependence-based representations , 1993, Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation.