Identifying Test Cases for Stored Procedure Using Cyclomatic Complexity Approach

Testing is very important but expensive and time consuming process in software development. Software quality enhancement can be achieved through the use of a systematic program testing methodology. Few testing methodologies were discussed in this paper such as cyclomatic complexity, specification-ba...

Full description

Saved in:

Bibliographic Details
Main Author:	Rosmah, Ismail
Format:	Thesis
Language:	eng eng
Published:	2009
Subjects:	QA71-90 Instruments and machines QA76 Computer software
Online Access:	https://etd.uum.edu.my/1743/1/Rosmah_Ismail.pdf https://etd.uum.edu.my/1743/2/1.Rosmah_Ismail.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uum-etd.1743
record_format	uketd_dc
institution	Universiti Utara Malaysia
collection	UUM ETD
language	eng eng
topic	QA71-90 Instruments and machines QA76 Computer software
spellingShingle	QA71-90 Instruments and machines QA76 Computer software Rosmah, Ismail Identifying Test Cases for Stored Procedure Using Cyclomatic Complexity Approach
description	Testing is very important but expensive and time consuming process in software development. Software quality enhancement can be achieved through the use of a systematic program testing methodology. Few testing methodologies were discussed in this paper such as cyclomatic complexity, specification-based testing, and structural-based automatic program testing. This paper complements a research on cyclomatic complexity approach in determining the number of test cases that are necessary to achieve thorough test coverage of a particular Oracle stored procedures. Cyclomatic complexity which was developed by Thomas J. McCabe Sr. in 1976 is used to measure the complexity of a program. It directly measures the number of linearly independent paths through a program's source code. The goal of this study is to identify the minimum number of test cases required or a given stored procedure, and cyclomatic complexity was chosen as an approach to achieve this goal. It was discussed thoroughly in chapter 3 of this paper, and testing of this approach was explained in chapter 4. It was found that the higher cyclomatic complexity measure indicates the higher complexity of a program and is more complex to maintain.
format	Thesis
qualification_name	masters
qualification_level	Master's degree
author	Rosmah, Ismail
author_facet	Rosmah, Ismail
author_sort	Rosmah, Ismail
title	Identifying Test Cases for Stored Procedure Using Cyclomatic Complexity Approach
title_short	Identifying Test Cases for Stored Procedure Using Cyclomatic Complexity Approach
title_full	Identifying Test Cases for Stored Procedure Using Cyclomatic Complexity Approach
title_fullStr	Identifying Test Cases for Stored Procedure Using Cyclomatic Complexity Approach
title_full_unstemmed	Identifying Test Cases for Stored Procedure Using Cyclomatic Complexity Approach
title_sort	identifying test cases for stored procedure using cyclomatic complexity approach
granting_institution	Universiti Utara Malaysia
granting_department	College of Arts and Sciences (CAS)
publishDate	2009
url	https://etd.uum.edu.my/1743/1/Rosmah_Ismail.pdf https://etd.uum.edu.my/1743/2/1.Rosmah_Ismail.pdf
_version_	1747827197870080000
spelling	my-uum-etd.17432013-07-24T12:12:59Z Identifying Test Cases for Stored Procedure Using Cyclomatic Complexity Approach 2009 Rosmah, Ismail College of Arts and Sciences (CAS) College of Arts and Sciences QA71-90 Instruments and machines QA76 Computer software Testing is very important but expensive and time consuming process in software development. Software quality enhancement can be achieved through the use of a systematic program testing methodology. Few testing methodologies were discussed in this paper such as cyclomatic complexity, specification-based testing, and structural-based automatic program testing. This paper complements a research on cyclomatic complexity approach in determining the number of test cases that are necessary to achieve thorough test coverage of a particular Oracle stored procedures. Cyclomatic complexity which was developed by Thomas J. McCabe Sr. in 1976 is used to measure the complexity of a program. It directly measures the number of linearly independent paths through a program's source code. The goal of this study is to identify the minimum number of test cases required or a given stored procedure, and cyclomatic complexity was chosen as an approach to achieve this goal. It was discussed thoroughly in chapter 3 of this paper, and testing of this approach was explained in chapter 4. It was found that the higher cyclomatic complexity measure indicates the higher complexity of a program and is more complex to maintain. 2009 Thesis https://etd.uum.edu.my/1743/ https://etd.uum.edu.my/1743/1/Rosmah_Ismail.pdf application/pdf eng validuser https://etd.uum.edu.my/1743/2/1.Rosmah_Ismail.pdf application/pdf eng public masters masters Universiti Utara Malaysia Ana C.V. De Melo, Kleber S.Xavior P.N 2008, 'Towards Verification and Testing of Java Programs'. Symposium on Applied computing Proceedings of the 2008, Fortaleza, Ceara, Brazil, ACM. New York, pp.730-734. Atif M. Menon, Martha E. Pollack, Mary Lo Soffa 1999, ' Using a Goal-driven Approach to Generate Test Cases for GUls', Proceedings of the 21st international conference on Software engineering, Los Angeles ,ACM, New York,pp.257-266. Baowen Xu, J. Q., Xiaofang Zhang,Zhongqiang Wu,Lin Chen 2005, ' A Brief Survey of Program Slicing'. ACM SIGSOGT Software Engineering, vol.30, no.2, pp.1-36. Beizer, B 1990, Software Testing Techniques, 2nd Edition, Thompson Computer Press, New York. Bertolino, A 2007, ' Software Testing Research: Achievements, Challenges, Dreams', International Conference on Software Engineering a 2007 Future of Software Engineering, Italy, IEEE, Washington, pp.85-103. Bergadano F 1993, 'Test Case Generation by means of Learning Techniques'. Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering, Los Angeles, ACM, New York, pp. 149-162. Baresi L 2001, 'On Accurate Automatic Verification of Publish-Subscribe Architectures', Proceedings of the 29th international conference on Software Engineering. Los Angeles, IEEE Computer Society, Washington, pp. 199-208. Burleson K.D 2006, Oracle Tuning, The Definition References, Oracle in-Focus Series, online, retrieved March 5,2009 from http://www.praetoriate.com/oracle_tips.htm. Basili, V. R 1981, ' Evaluating and comparing software metrics in the software engineering laboratory', Proceedings of the 1981 ACM workshop/symposium on Measurement and evaluation of software quality. New York, ACM, New York, pp.95-106, Gupta 2001, Measuring the Complexity of 00 Systems, online, retrieved March 2,2009 from http://javaboutique.internet.com/tutorials/metrics/. David Chays, Saikat Dan, Frank, P. G 2000, ' A Framework for Testing Database Applications', Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis, Oregon,ACM, New York, pp.147-157. David Willmor, S. M. E 2006, ' An Intensional Approach to the Specification of Test Cases for Database Applications', Proceedings of the 28th international conference on Software engineering, Shanghai, ACM, New York, pp.102-111. Donald Burleson K 2006, Oracle DBMS Tips, online, retrieved March 2,2009 from http://www.praetoriate.com/oracle_tips.htm. Elshoff, J.L 1978, ' On the Use of the Cyclomatic Number to Measure Program Complexity',Journal of advertising, vo1.13, no.2, pp.29 - 40. Huang, J. C 1975, ' An Approach to Program Testing'. Journal of advertising, vol.7, no. 3, pp. 113-128. James L.Elshoff, M. M 1978, ' On the use of the cyclomatic number to measure program complexity', Journal of advertising, vol.13, no. 3, pp.29-40. James McCaffrey D 2006, 'Software testing certification', online, retrieved March 19,2009 from http://jamesmccaffrey.spaces.live.com/ Javier Jesus Gutierrez, M. E 2006, ' An approach to generate test cases from use cases', Proceedings of the 6th international conference on Web engineering, California, ACM, New York, pp.113-114. Javed A.Z, Watson G.N 2007, ' Automated Generation of Test Cases Using Model-Driven Architecture'. Proceedings of the 29th International Conference on Software Engineering Workshops, Queensland, IEEE Computer Society, Washington, pp.200-222. Jose Carlos Bregieiro Ribeiro 2008, ' A strategy for evaluating feasible and unfeasible test cases for the evolutionary testing of object-oriented software'. Proceedings of the 3rd international workshop on Automation of software test Leipzig, Germany, ACM, New York, pp.85-92. Julian Byke 2006, Oracle 11.1 Keywords, online, retrieved March 20,2009 from http://www.juliandyke.com/lnternals/Oraclell_l/Keywords.html Laski, J. W 1980, ' A hierarchical approach to program testing', Journal of advertising, vo1.15, no. 4, pp.77-85. Lopes C.V 2005, ' An analysis of modularity in aspect oriented design', Proceedings of the 4th international conference on Aspect-oriented software development, Chicago, ACM, New York, pp.15-66. Miller E.F.,Melton J.R 1975, ' Automated Generation of Testcase Datasets', Proceedings of the International Conference on Reliable Software, Los Angeles,ACM. New York, pp.51-58. Mccabe, T. J 1976, ' A complexity measure'. Proceedings of the 2nd international conference on Software engineering, San Francisco, IEEE Computer Society Press, Wasington, pp.407-423. Myers,G.J 1977, ' An extension to the cyclomatic measure of program complexity', Journal of advertising, vol. 12, no. 10, pp.61-64. Neena Kochar, E.G., Priya Nathan 1999, Introduction to Oracle: SQL/PL/SQL, Jerry Bosnan. Ostrand, T.J 1988, ' The Category-Partition Method for Specifying and Generating Functional Tests', journal of advertising, vo1.31, pp.676-686. Qing Xie A. M. M 2007, ' Designing and Comparing Automated Test', Oracles for GUI-Based Software Applications, Washington, ACM Transactions on Software Engineering and Methodology (TOSEM), New York, vo1.16. Reifer D 1974, ' Automating formal specification based testing'. In Proceeding Conference on Theory and Practice of Software Development, Italy, ACM, New York, pp.833-847. Richard A. Demillo, A. J. 0 1993, 'Experimental results from an automatic test case generator'. Journal of advertising. vol.2, no. 10, pp. 109-127. Sullivan J.E 1973, 'Measurement of program complexity by the pair', Journal of advertising, vol.13, no.3, pp.61-64. Shyamal Suhana Chandra K.C 2005, ' A Comparison of Java and C#, Journal of Computing Sciences in Colleges, vo1.20, no.2, pp.238-254. Stwarz, F 2006, Java Complexity Measurement, online, retrieved March 10, 2009 From http://www.leepoint.net/notejava/principles_and_practices/complexity/complexity_measurement.html Tao Xie, J. Z 2007, ' Perspectives on automated testing of aspect-oriented programs' Proceedings of the 3rd workshop on Testing aspect-oriented programs, New York, ACM, New York, pp.7-12. Thomas J McCabbe, C. W. B 1989, ' Design Complexity Measurement and Testing', Journal of advertising, vol.32, no.10, pp. 1415-1425. Watkins J 2001, IT : An Off-the-shelf Software Testing Handbook, NY USA, 2nd edition,Cambridge University Press, New York. Wee Kheng Leow, S. C. K., Yi Sun 2004, ' Automated Generation of Test Programs From Closed Specification of Classes and Test Cases', Proceedings of the 26th International Conference on Software Engineering. New York, IEEE Computer Society, Washington, pp.96-105.

Identifying Test Cases for Stored Procedure Using Cyclomatic Complexity Approach

Similar Items