Selecting Software Testing Criterion based on Complexity Measurement

Wen C. Pai; Chun-Chia Wang; Ding-Rong Jiang

doi:10.6180/jase.1999.2.1.03

Selecting Software Testing Criterion based on Complexity Measurement

Computer Science and Information Engineering

Wen C. Pai¹, Chun-Chia Wang¹and Ding-Rong Jiang¹

¹Department of Information Management Kuang Wu Institute of Technology, PeiTou, Taipei 112, Taiwan, R.O.C.

Received: March 5, 1999
Accepted: April 13, 1999
Publication Date: April 13, 1999

Download Citation: ||https://doi.org/10.6180/jase.1999.2.1.03

ABSTRACT

Software testing is an important process in software quality assurance(SQA). Software testing consumes the majority of the software developers' time and cost of all the phases of system development. An important problem in software testing is to determine whether a program has been tested enough with a testing criterion and when one could stop testing. On the other hand, software measurement is used to estimate the quality of a software. Complexity measures can be used to compare software quality and development cost. This paper proposes a new testing approach which choosing testing path based on path complexity. The process is to use a set of testing paths that satisfying all-uses testing criterion, and then choose the testing path with the most complexity to test. This process is continued until the program can be accepted. The proposed formula is used to determine if it is possible to stop testing before satisfying all-du-paths testing criterion. The main contribution of the paper is that software developers can choose a proper testing action with lower testing effort.

Keywords: Software Quality Assurance, Software Testing, White-Box Testing, Path Testing, Software Complexity

REFERENCES

[1]. Cho, C. Q., Quality Programming: Developing and Testing Software Using Statistical Quality Control, New York: Wiley (1987).
[2]. Frankl, P. G. and Weyuker, E. J., “An Applicable Family of Data Flow Testing Criteria,” IEEE tran. on S.E., Vol.4, No.10, pp.1483-1498 (1988).
[3]. Humphrey, W. S., A Discipline for Software Engineering, New York: Addison Wesley (1995).
[4]. Ntafos, S. C., “On Required Element Testing,” IEEE tran on S.E., Vol.10, No. 6, pp.795-803 (1984).
[5]. Pai, W. C., Wang, C. C. and Lin, H., “A Study of Software Testing based on Program Complexity,” Proceeding of the Int'l Conference of Computer Applications in Industry and Engineering, pp.44-47 (1997).
[6]. Rapps, S. and Weyuker, E. J., “Selecting software test data using data flow information,” IEEE tran. on S.E., Vol.14, No.4, pp.367-375 (1985).
[7]. Weyuker, E. J. and Jeng, B., “Analyzing Partition testing strategies,” IEEE tran. on S.E., Vol.17, No. 7, pp.703-711 (1991).
[8]. Woodward, M. R., Hedley, D. and Hennell, M. A., “Experience with Path Analysis and Testing of Programs,” IEEE tran. on S.E., Vol.6, No. 3, pp.278-286 (1980).
[9]. Zhu, H., “A Formal Analysis of the Subsume Relation Between Software Test Adequacy Criteria,” IEEE tran. on S.E., Vol.22, No.4, pp.248-255 (1996).