A dependence graph-based representation for test coverage analysis of object-oriented programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A dependence graph-based representation for test coverage analysis of object-oriented programs

Full text

Pdf (458 KB)

Source

ACM SIGSOFT Software Engineering Notes archive
Volume 34 , Issue 2 (March 2009) table of contents

SECTION: Article abstracts with full text online table of contents

Pages 1-8

Year of Publication: 2009

ISSN:0163-5948

Authors

ESF Najumudheen	Indian Institute of Technology, Kharagpur, India
Rajib Mall	Indian Institute of Technology, Kharagpur, India
Debasis Samanta	Indian Institute of Technology, Kharagpur, India

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 25, Downloads (12 Months): 133, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1507195.1507208 What is a DOI?

ABSTRACT

Test coverage analysis is used to determine the extent to which different features of interest are exercised by a given test suite. For object-oriented programs, it involves determining the extent to which features such as inheritance, polymorphism, dynamic binding, etc. are exercised. As object-oriented coverage analysis using only source code or object code is difficult and inefficient, the source code is converted to a suitable intermediate representation for subsequent analysis. We propose a dependence graph-based representation for object-oriented programs, named Call-based Object-Oriented System Dependence Graph (COSDG). COSDG captures the important object-oriented features, provides details of method visibility in a derived class, and differentiates various calling contexts with different type of method call edges: simple, inherited, and polymorphic. We also propose an algorithm to construct COSDG incrementally. Though COSDG has been developed primarily to aid test coverage analysis, it can be used in a variety of other software engineering applications also.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Robert V. Binder, Testing object-oriented systems: models, patterns, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1999
	2	Jeanne Ferrante , Karl J. Ottenstein , Joe D. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.3, p.319-349, July 1987 [doi>10.1145/24039.24041]
	3	Karl Joseph Ottenstein, Data-flow graphs as an intermediate program form., Purdue University, West Lafayette, IN, 1978
	4	Susan Horwitz , Thomas Reps , David Binkley, Interprocedural slicing using dependence graphs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.1, p.26-60, Jan. 1990 [doi>10.1145/77606.77608]
	5	B. G. Ryder, Constructing the Call Graph of a Program, IEEE Transactions on Software Engineering, v.5 n.3, p.216-226, May 1979 [doi>10.1109/TSE.1979.234183]
	6	Gregg Rothermel , Mary Jean Harrold, Selecting Regression Tests for Object-Oriented Software, Proceedings of the International Conference on Software Maintenance, p.14-25, September 01, 1994
	7	Loren Larsen , Mary Jean Harrold, Slicing object-oriented software, Proceedings of the 18th international conference on Software engineering, p.495-505, March 25-29, 1996, Berlin, Germany
	8	D. Liang , M. J. Harrold, Slicing Objects Using System Dependence Graphs, Proceedings of the International Conference on Software Maintenance, p.358, March 16-19, 1998
	9	Brian A. Malloy , John D. McGregor , Anand Krishnaswamy , Murali Medikonda, An extensible program representation for object-oriented software, ACM SIGPLAN Notices, v.29 n.12, p.38-47, Dec. 1994 [doi>10.1145/193209.193218]
	10	M. J. Harrold and G. Rothermel, "A coherent family of analyzable graphical representations for object-oriented software," Department of Computer and Information Science, The Ohio State University, Technical Report OSU-CISRC-11/96-TR60, Nov. 1996.
	11	J. Zhao, "Applying program dependence analysis to Java software," in Proc. of Workshop on Software Engineering and Database Systems, 1998 International Computer Symposium, Tainan, Taiwan, Dec. 1998, pp. 162--169.
	12	N. Walkinshaw, M. Roper, and M. Wood, "The Java system dependence graph," in Proc. of the Third IEEE International Workshop on Source Code Analysis and Manipulation, (SCAM '03), Amsterdam, The Netherlands, Sep. 2003, pp. 55--64.
	13	A. M. R. Vincenzi , J. C. Maldonado , W. E. Wong , M. E. Delamaro, Coverage testing of Java programs and components, Science of Computer Programming, v.56 n.1-2, p.211-230, April 2005 [doi>10.1016/j.scico.2004.11.013]
	14	Hira Agrawal, Efficient coverage testing using global dominator graphs, Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, p.11-20, September 06-06, 1999, Toulouse, France
	15	Atanas Rountev , Scott Kagan , Michael Gibas, Static and dynamic analysis of call chains in java, Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis, July 11-14, 2004, Boston, Massachusetts, USA
	16	Fragment Class Analysis for Testing of Polymorphism in Java Software, IEEE Transactions on Software Engineering, v.30 n.6, p.372-387, June 2004 [doi>10.1109/TSE.2004.20]
	17	E. S. F. Najumudheen, "An intermediate representation for test coverage analysis of object-oriented programs," Indian Institute of Technology, Kharagpur, India, Tech. Rep. IITKGP-CSE-TR-17/2008, Jan. 2008.