教師資料查詢 | 類別: 會議論文 | 教師: 王英宏 Wang Ying-hong (瀏覽個人網頁)

標題:以資料範圍為基礎之物件導向程式複雜度衡量 Complexity Measurement for Object-Oriented Programming Based on Data Scope
學年94
學期2
發表日期2006/06/09
作品名稱以資料範圍為基礎之物件導向程式複雜度衡量 Complexity Measurement for Object-Oriented Programming Based on Data Scope
作品名稱(其他語言)
著者王英宏; 林大鈞
作品所屬單位淡江大學資訊工程學系
出版者
會議名稱第二屆台灣軟體工程研討會暨軟體工程聯盟課程教材成果發表會
會議地點Taipei, Taiwan
摘要Software metrics is a necessary step for software reliability and quality. Software metrics technique of traditional procedure-oriented programming is fairly maturity and has various methodologies and tools available for use. Object-oriented programming (OOP) becomes more popular. However, traditional procedure-oriented software metrics are not appropriate for the development of an object-oriented software. Some research of object-oriented software metrics has been proposed. Nevertheless, most of these metrics only focus on one specific characteristic of the object-oriented software. In this paper, a new metric methodology, the data scope complexity is proposed, for object-oriented software based on data scope of a program. The data scope complexity can present complexities of multiple features of object-oriented programming at the same time. Also, the advantages of OOP comparing with procedure-oriented programming are quantified and proved.
關鍵字Object-oriented programming (OOP);Software metrics;Data scope;Programming language;Friend function;Public variable;Protected variable;Private variable
語言英文
收錄於
會議性質國內
校內研討會地點
研討會時間20060609~20060610
通訊作者
國別中華民國
公開徵稿Y
出版型式紙本
出處第二屆台灣軟體工程研討會暨軟體工程聯盟課程教材成果發表會論文集6頁
相關連結
Google+ 推薦功能,讓全世界都能看到您的推薦!