A Study of Applying Extended PIE Technique to Software Testability Analysis

被引:5
作者
Tsai, Tsung-Han [1 ]
Huang, Chin-Yu [1 ,2 ]
Chang, Jun-Ru [2 ]
机构
[1] Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu 30043, Taiwan
[2] Natl Tsing Hua Univ, Inst Informat Syst & Appl, Hsinchu 30043, Taiwan
来源
2009 IEEE 33RD INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE, VOLS 1 AND 2 | 2009年
关键词
COMPONENTS; COVERAGE; VERIFICATION; SYSTEMS;
D O I
10.1109/COMPSAC.2009.22
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
During the software development process, data that has been gained from the testing phase can help developers to predict software reliability more precisely But the testing stage usually takes more and more effort due to the growing complexity of software. How to build software that can be tested efficiently has become an important topic in addition to enhancing and developing new testing methods. Thus, research on software testability has been developed variously In the past, a dynamic technique for estimating program testability was proposed and called propagation, infection, and execution (PIE) analysis. Previous research studies show that PIE analysis can complement software testing. However this technique requires a lot of computational overhead in estimating the testability of software components. In this paper, we propose an Extended PIE (EPIE) technique to accelerate the traditional PIE analysis, based on generating group testability as a substitute for location testability This technique can be separated into three steps: breaking a program into blocks, dividing blocks into groups, and marking target statements. We developed a tool called ePAT (extended PIE Analysis Tool) to help us identify the locations which will be analyzed. The experimental results show that the number of analyzed locations can be effectively decreased and that the estimated value of testability remains acceptable and useful.
引用
收藏
页码:89 / +
页数:3
相关论文
共 34 条
[1]   Measuring and improving design patterns testability [J].
Baudry, B ;
Le Traon, Y ;
Sunyé, G ;
Jézéquel, JM .
NINTH INTERNATIONAL SOFTWARE METRICS SYMPOSIUM, PROCEEDINGS, 2003, :50-59
[2]  
BEIZER B., 1983, SOFTWARE TESTING TEC
[3]   The Cook Inc Gianturco-Roubin Flex-Stent [J].
Berger, PB .
JOURNAL OF INTERVENTIONAL CARDIOLOGY, 1996, 9 (02) :145-152
[4]   DESIGN FOR TESTABILITY IN OBJECT-ORIENTED SYSTEMS [J].
BINDER, RV .
COMMUNICATIONS OF THE ACM, 1994, 37 (09) :87-101
[5]   An empirical study into class testability [J].
Bruntink, Magiel ;
van Deursen, Arie .
JOURNAL OF SYSTEMS AND SOFTWARE, 2006, 79 (09) :1219-1232
[6]   EFFICIENTLY COMPUTING STATIC SINGLE ASSIGNMENT FORM AND THE CONTROL DEPENDENCE GRAPH [J].
CYTRON, R ;
FERRANTE, J ;
ROSEN, BK ;
WEGMAN, MN ;
ZADECK, FK .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1991, 13 (04) :451-490
[7]   The impact of software evolution on code coverage information [J].
Elbaum, S ;
Gable, D ;
Rothermel, G .
IEEE INTERNATIONAL CONFERENCE ON SOFTWARE MAINTENANCE, PROCEEDINGS: SYSTEMS AND SOFTWARE EVOLUTION IN THE ERA OF THE INTERNET, 2001, :170-179
[8]   TESTABILITY OF SOFTWARE COMPONENTS [J].
FREEDMAN, RS .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1991, 17 (06) :553-564
[9]  
Gao J, 2005, P INT COMP SOFTW APP, P211
[10]   Testability transformation [J].
Harman, M ;
Hu, L ;
Hierons, R ;
Wegener, J ;
Sthamer, HS ;
Baresel, A ;
Roper, M .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2004, 30 (01) :3-16