Unreachable procedures in object-oriented programming

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Unreachable procedures in object-oriented programming

Full text

Pdf (579 KB)

Source

ACM Letters on Programming Languages and Systems (LOPLAS) archive
Volume 1 , Issue 4 (December 1992) table of contents

Pages: 355 - 364

Year of Publication: 1992

ISSN:1057-4514

Author

Amitabh Srivastava

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 48, Citation Count: 14

Additional Information:

abstract references cited by index terms

Tools and Actions:	Request Permissions 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/161494.161517 What is a DOI?

ABSTRACT

Unreachable procedures are procedures that can never be invoked. Their existence may adversely affect the performance of a program. Unfortunately, their detection requires the entire program to be present. Using a long-time code modification system, we analyze large, linked, program modules of C++, C, and Fortran. We find that C++ programs using object-oriented programming style contain a large fraction of unreachable procedure code. In contrast, C and Fortran programs have a low and essentially constant fraction of unreachable code. In this article, we present our analysis of C++, C, and Fortran programs, and we discuss how object-oriented programming style generates unreachable procedures.

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	AMERICAN NATIONAL STANDARD INSTITUTE. 1966. ANSI Standard Fortran. ANSI, New York.
	2	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	3	BOBROW, D. G., AND STEFIK, M.J. 1983.The LOOPS Manual. Xerox Corporation, Palo Alto, Calif.
	4	J. M. Coggins , G. Bollella, Managing C++ libraries, ACM SIGPLAN Notices, v.24 n.6, p.37-48, June 1989 [doi>10.1145/71052.71058]
	5	Margaret A. Ellis , Bjarne Stroustrup, The annotated C++ reference manual, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	6	Brian W. Kernighan , Dennis M. Ritchie, The C programming language, Prentice Hall Press, Upper Saddle River, NJ, 1989
	7	Bertrand Meyer, Eiffel: the language, Prentice-Hall, Inc., Upper Saddle River, NJ, 1992
	8	J Rees , W Clinger, Revised report on the algorithmic language scheme, ACM SIGPLAN Notices, v.21 n.12, p.37-79, Dec. 1986 [doi>10.1145/15042.15043]
	9	Guy L. Steele, Jr., Common LISP: the language, Digital Press, Newton, MA, 1984
	10	SRIVASTAVA, A. 1985. SCOOPS: Scheme object-oriented programming system. Rep. CSL-23, Texas Instruments, Dallas, Tex.
	11	SRIVASTAVA, A., AND WALL, D.W. 1993. A practical system for intermodule code optimization at link-time. J. Program. Lang. 1 (Mar.), 1-18. Also available as WRL Research Report 92/6, December 1992.
	12	Bjarne Stroustrup, The C++ programming language (2nd ed.), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1991
	13	TEXAS INSTRUMENTS. 1985. TI Scheme Language Reference Manual. Texas Instruments, Austin, Tex.
	14	Daniel Weinreb, Lisp machine manual, Massachusetts Institute of Technology, 1981

CITED BY 14

	Amitabh Srivastava , Alan Eustace, ATOM: a system for building customized program analysis tools, ACM SIGPLAN Notices, v.29 n.6, p.196-205, June 1994
	Frank Tip , Jens Palsberg, Scalable propagation-based call graph construction algorithms, ACM SIGPLAN Notices, v.35 n.10, p.281-293, Oct. 2000
	Peter F. Sweeney , Frank Tip, A study of dead data members in C++ applications, ACM SIGPLAN Notices, v.33 n.5, p.324-332, May 1998
	David F. Bacon , Peter F. Sweeney, Fast static analysis of C++ virtual function calls, ACM SIGPLAN Notices, v.31 n.10, p.324-341, Oct. 1996
	Bjorn De Sutter , Bruno De Bus , Koen De Bosschere , Saumya Debray, Combining Global Code and Data Compaction, ACM SIGPLAN Notices, v.36 n.8, p.29-38, Aug. 2001
	Ole Agesen , David Ungar, Sifting out the gold: delivering compact applications from an exploratory object-oriented programming environment, ACM SIGPLAN Notices, v.29 n.10, p.355-370, Oct. 1994
	Frank Tip , Peter F. Sweeney, Class hierarchy specialization, ACM SIGPLAN Notices, v.32 n.10, p.271-285, Oct. 1997
	Thomas R. Arnold , William A. Fuson, Testing “in a perfect world”, Communications of the ACM, v.37 n.9, p.78-86, Sept. 1994
	Frank Tip , Jong-Deok Choi , John Field , G. Ramalingam, Slicing class hierarchies in C++, ACM SIGPLAN Notices, v.31 n.10, p.179-197, Oct. 1996
	Amitabh Srivastava , Alan Eustace, ATOM: a system for building customized program analysis tools, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Bjorn De Sutter , Bruno De Bus , Koen De Bosschere, Sifting out the mud: low level C++ code reuse, ACM SIGPLAN Notices, v.37 n.11, November 2002
	Bjorn De Sutter , Bruno De Bus , Koen De Bosschere, Link-time binary rewriting techniques for program compaction, ACM Transactions on Programming Languages and Systems (TOPLAS), v.27 n.5, p.882-945, September 2005
	Rajeev Kumar , Soham S. Chakraborty, Precise static type analysis for object oriented programs, ACM SIGPLAN Notices, v.42 n.2, p.17-26, February 2007
	Alan Eustace , Amitabh Srivastava, ATOM: a flexible interface for building high performance program analysis tools, Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings, p.25-25, January 16-20, 1995, New Orleans, Louisiana