本研究嘗試針對特定應用領域的軟體系統，推導出一個能衡量出系統中程式與程式之間的相對複雜關係的複雜度衡量模式，並且嘗試驗證此模式的衡量結果在實務上能具有參考價值。
因此，在特定領域軟體系統的選擇上，本研究選定國內某銀行建置在IBM Mainframe平台上，以IBM Mainframe COBOL語言撰寫的信用卡應用系統之程式做為衡量標的，從中挑選數支樣本程式並利用本研究推導的複雜度衡量模式加以衡量，以求取出這些樣本程式之相對複雜度排序。接著，本研究亦請負責維護這些樣本程式的程式人員，針對同樣的程式依其本身對程式複雜程度的認知，排出相對順序。最後，本研究驗證這二個複雜度排列順序之間，有高度的正相關存在。
藉由與特定系統之程式開發人員本身，對於此系統中程式之複雜度認知的結果做比較，本研究證明了此衡量模式可應用在實務上之系統複雜度衡量上，並希望此衡量模式所產生的相對複雜度衡量結果，能對於軟體系統的一些特質的衡量，如開發人日工時的量測、系統錯誤率的量測等，有更進一步地幫助。

In this study, we try to define a measure method which is sensitive to many software characteristics for the complexity of special application software.
Thus, we choose a credit card system of a bank in Taiwan. The system environment of this credit card system is IBM z/OS390. The computer language used to write this system is IBM Mainframe COBOL. We randomly select several programs from the system to be the sample. We use our method to measure these programs’ complexity first, and then obtain these programs’ relative complexity by sorting their complexity measures. To verify if our method is acceptable, we also request some programmers who are responsible for the development of this credit card system to sort those sample programs by complexity. Then we use the correlation coefficient test to measure the association between the two sorting results.
The correlation test shows that our measure method is acceptable. We hope the measure method can be applicable in some management work, for example, man power allocation for software development, the prediction of fault rate of a software system, etc..

一、中文部份
[1] 賴秀女, 2001,”軟體複雜度評估 - 一種修正的堆疊基馬可夫模式”,南華大學資訊管理研究所碩士論文。
二、英文部份
[2] Anneberg, L.and Singh, H., “Circuit theoretic approaches to determining software complexity” 36th. Midwest Symposium on Circuits and Systems Vol. 36/2. pp.895-898.
[3] Basili, V.R., “Qualitative software complexity models: A summary”, In Tutorial on Models and Methods for Software Management and Engineering, IEEE Computer Society Press, Los Alamitos, Calif., 1980.
[4] Conte, S. D., Dunsmore, H. E, and Shen, V. Y., “A Software Engineering Metrics and Models”, Benjamin-Cummings, Menlo Park, CA, 1986, pp. 396.
[5] Edwards, William R.; Yang, Mingguey, and Kim, Jong Soo, “Application of the Stack-Based Markov Source to Software Analysis”, Proceeding, Minnowbrook Workshop on Software Engineering, July 1991, pp. 44-62.
[6] Elshoff, James L., “Characteristic Program Complexity Measures”, International Conference on Software Engineering, Proceedings of the 7th international conference on software engineering, 1984, pp. 288 – 293.
[7] Fenton, N., “Software measurement: a necessary scientific basis”, Software Engineering, IEEE Transactions on Volume 20, Issue 3, March 1994, pp.199 – 206.
[8] Gordon, R. D., “Measuring Improvements in Program Clarity”, IEEE Transactions on Software Engineering, Vol. SE-5, NO. 2, Mar., 1979, pp.79-90.
[9] Gray, R.b. and Caswell, D., “Software Metrics: Establishing a Company-wide Program”, Prentice Hall PTR, 1st edition, May 27, 1987.
[10] Halstead, M. H., “Elements of Software Science, Operating and Programming Systems Service”, Elsevier, New York, 1977.
[11] Henry, Sallic and Kafura, Dennis, “Software Structure Metrics Based on Information Flow”, IEEE Transactions on Software Engineering, vol. SE-7, no.5, September 1981, pp.510 -518.
[12] McCabe, T. J., “A complexity measure”, IEEE Transactions of Software Engineering, Vol. SE-2, No. 4, Dec. 1976, pp. 308-320.
[13] Ramamurthy, B. and Melton, A., ”A synthesis of software science measures and the cyclomatic number”, IEEE Transactions on Software Engineering, Volume 14, Issue 8, Aug. 1988, pp. 1116 – 1121.
[14] Sedlmeyer , Robert L., Kearney , Joseph K., Thompson, William B., Adler, Michael A. and Gray , Michael A., “Problems with software complexity measurement”, Proceedings of the 1985 ACM thirteenth annual conference on Computer Science, March 1985, pp. 340-347.
[15] Shannon, C. E., “A Mathematical Theory of Communication”, Bell Systems Technical Journal, vol. 27, 1948, pp. 379-423.
[16] Shao, Jingqiu and Wang, Yingxu, “A New Measure of Software Complexity based on Cognitive Weights”, Electrical and Computer Engineering, 2003. IEEE CCECE 2003. Canadian Conference on Volume 2, 4-7 May 2003, pp. 1333 – 1338.
[17] Wang, Yingxu, ”On the informatics laws of software”, Cognitive Informatics, 2002. Proceedings. First IEEE International Conference on 19-20, Aug. 2002, pp. 132 – 141.
[18] Wangi, Yingxu and Wang, Ying, ” Cognitive models of the brain”, Cognitive Informatics, 2002. Proceedings. First IEEE International Conference on 19-20 Aug. 2002, pp. 259 – 269.
[19] Wohlin, C., “Revisiting measurement of software complexity”, Software Engineering Conference, 1996, Proceedings, 1996 Asia-Pacific, 4-7 Dec. 1996, pp. 35 – 43.
[20] Zolnowski, J. C. and Simmons, D. B., “Taking the Measure of Program Complexity”, Proceedings, National Computer Condference, 1981, pp. 329-336.