跳到主要內容

臺灣博碩士論文加值系統

(44.222.104.206) 您好!臺灣時間:2024/05/25 22:12
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:王英宏
研究生(外文):Wang, Ying-Hong
論文名稱:以程式解析法對軟體測試與複雜度衡量之研究
論文名稱(外文):Software Testing and Complexity Measurement Based on Program Decomposition
指導教授:莊淇銘莊淇銘引用關係
指導教授(外文):Chi-Ming Chung
學位類別:博士
校院名稱:淡江大學
系所名稱:資訊工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:1996
畢業學年度:84
語文別:中文
論文頁數:120
中文關鍵詞:軟體測試軟體衡量並行程式物件導向程式工作元間之通訊
外文關鍵詞:Software TestingSoftware MetricsRendezvousConcurrent ProgramsObject-Oriented ProgramsInter-Tasks Communication
相關次數:
  • 被引用被引用:0
  • 點閱點閱:314
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:2
在軟體發展生命周期中,軟體測試與衡量是兩項非常重要的技術。
軟體測試與衡量的目的在確保軟體品質與正確性。雖然分析與設計在軟體
發展生命周期是很重要的階段,但是,測試與衡量仍是軟體可靠度與品質
必需的步驟。吾人可從兩方面著手確保軟體的可靠度與品質,其一是透過
軟體測試來降低軟體的錯誤,期二是利用軟體衡量來監控軟體開發的程序
以提升程式的品質。本論文中,將提出一系列從程式解析法觀點的方法論
與演算法來討論軟體測試與衡量。第一部份是一個提供評量不同測試方法
效能的量化分析。並以此理論為基礎,開發了一個軟體工具。第二部份是
基於 McCabe 的 cyclomatic complexity的缺失,無法反應程式中巢狀結
構決策點的複雜度,本論文將提出一個更精確且更容易衡量程式複雜度的
方法,稱為 Path Complexity。此外,也將提出此衡量方法的演算法以說
明其可行性。再者,由於並行程式主要的特性是 rendezvous ,因此,本
論文將並行程式的測試問題專注於 rendezvous上討論。故第三部份則是
從 rendezvous 解析的觀點提出了四種測試並行程式的測試準則。另外,
本論文也提出四個方程式來衡量並行程式的複雜度問題。最後一部份,則
是將從 data scope 的觀點出發,討論物件導向程式複雜度的衡量問題。
最近幾年來,物件導向程式設計愈來愈流行,然而,傳統的程序導向程式
的衡量方法並不能適用在物件導向的軟體上。在本論文中,將為物件導向
軟體提出一個新的衡量方法,稱為 data scope complexity。此 data
scope complexity可以同時反應出物件導向程式設計之多種特性的複雜度
。此外,本論文也量化了物件導向程式設計與程序導向程式設計比較的差
異值,將物件導向程式設計的優點以量化的指標值表現出來。
Software testing and metrics are two very important
techniques in a software development life cycle (SDLC). The
purpose of software testing and metrics are to assure software
quality and software correctness. They are necessary steps for
software reliability and quality. The software testing is to
minimize errors,and the software metrics is to monitor the
software development process in order to improve the quality of
a program. In this thesis, a series of methodologies and
algorithms to discuss software testing and metrics from a view
of program decomposition is presented. Firstly, a quantitative
analysis is presented to provide a theoretical basis for
measuring testing efforts between different testing
methdoologies. A CASEtool based on this theory is then
developed. The second part is that the McCabe''s cyclomatic
complexity cannot reflect the nesting structure of program
decisions. Therefore, a more accurate and easier measuring
methodology, called the Path complexity is proposed, to measure
the complexity of programs. And an algorithm of the methodology
is presented. Futhermore, since one of the major characteristic
of concurrent programs is rendezvous, it is the rendezvous that
is focused for concurrent program testing. The third part is
based on the view of rendezvous decomposition, then four testing
criteria to test a concurrent program based on the rendezvous
are then development. Moreover, four equations to measure the
rendezvous complexity of concurrent programs are provided. The
last part is the complexity measurement of object-oriented
programs based on data scope. Recently, object-oriented
programming becomes popular. However, traditional procedure-
oriented software metrics are not appropriate for object-
oriented software. In this thesis, a new metric methodology, the
Data scope complexity, for object-oriented software based on
data scope of a program is presented. The data scope complexity
can show the complexities of multiple features of object-
oriented programming at the same time. Also, the comparison of
object-oriented programming with procedure-oriented programming
is quantified.
Cover
Abstract
Contents
1 Introduction
2 A Survey of Related Works Background of Software Testing
2.1 The Testing Hierarchy
2.2 Conctrol Flow Oriented Testing Methodologies
2.3 Data Flow Oriented Testing Methodologies
Background of Software Matrics
2.4 Program Size Based Metrics
2.5 Control Flow Based Metrics
2.6 Data Flow Based Metrics
Background of Concurrent Program Testing
2.7 Static Analysis Based Technoque
2.8 Deterministic Execution Based Techique
2.9 Execution Traces Based Technique
2.10 Controlled Execution Based Technique
Background of Object-oriented Program Matrics
2.11 Chidamber''s Measurement Theory
2.12 Chung''s Inheritance-Based Metrics
3 The Quantitative Analysis between the All-Statements and the All-Branches Testing Criteria through Pogram Decemposition
3.1 Motivation of this Research
3.2 The Limitation Research
3.3 The Quantitave Analysis
3.4 Texting Metric
4 The Complexity Measurement of Softwre through Program Decomposition
4.1 Motivation of this Research
4.2 The Based Analysis
4.3 Composition Analysis
4.4 Algorithm to Measure the Path Complexity
5 A Rendezvous Oriented Testing for Concurrent Programs
5.1 Motivation of this Research
5.2 The Principle of Rendezvous in Ada
5.3 Based Analysis and Definitions
5.4 Coverage Criteria Hierarchy
5.5 Software Metric for Concurrent Program based on Rendezvous
6 A Data Scope Metric for Object-Oriented Programs
6.1 Motivation of this Research
6.2 The Principle of Data Scope Mechanism in C++
6.3 Software Metrics for Object-Oriented Program based on Data Scope
6.4 Comparing with Procedure-Oriented Programming
7 Conclusions and Futures Works
Bibliography
Appendix
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top