Constructing call multigraphs using dependence graphs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Constructing call multigraphs using dependence graphs

Full text

Pdf (1.01 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Charleston, South Carolina, United States

Pages: 273 - 284

Year of Publication: 1993

ISBN:0-89791-560-7

Author

Arun Lakhotia

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 15, Citation Count: 12

Additional Information:

references cited by index terms collaborative colleagues

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/158511.158647 What is a DOI?

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	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	2	Allen, F. E. Interprocedural data flow analysis. In Proceedings IFIP Congress, 1974 (1974), North- Holland, pp. 398-402.
	3	John P. Banning, An efficient way to find the side effects of procedure calls and the aliases of variables, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.29-41, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567756]
	4	Burke, M. An interval-based approach to exhaustive and incremental interprocedural analysis. Tech. Rep. RC 12702, IBM Research Center, Yorktown Heights, NY, Sept. 1987.
	5	David Callahan , Alan Carle , Mary Wolcott Hall , Ken Kennedy, Constructing the Procedure Call Multigraph, IEEE Transactions on Software Engineering, v.16 n.4, p.483-487, April 1990 [doi>10.1109/32.54302]
	6	David Callahan , Keith D. Cooper , Ken Kennedy , Linda Torczon, Interprocedural constant propagation, Proceedings of the 1986 SIGPLAN symposium on Compiler construction, p.152-161, June 25-27, 1986, Palo Alto, California, United States
	7	Elliot J. Chikofsky , James H. Cross II, Reverse Engineering and Design Recovery: A Taxonomy, IEEE Software, v.7 n.1, p.13-17, January 1990 [doi>10.1109/52.43044]
	8	Song C. Choi , Walt Scacchi, Extracting and Restructuring the Design of Large Systems, IEEE Software, v.7 n.1, p.66-71, January 1990 [doi>10.1109/52.43051]
	9	Keith D. Cooper , Ken Kennedy, Efficient computation of flow insensitive interprocedural summary information, Proceedings of the 1984 SIGPLAN symposium on Compiler construction, p.247-258, June 17-22, 1984, Montreal, Canada
	10	Matthew S. Hecht, Flow Analysis of Computer Programs, Elsevier Science Inc., New York, NY, 1977
	11	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]
	12	Kam, J. B., and Ullman, J. D. Monotone data flow analysis frameworks. Acta Informatica 7 (1977), 305-317.
	13	Gary A. Kildall, A unified approach to global program optimization, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.194-206, October 01-03, 1973, Boston, Massachusetts [doi>10.1145/512927.512945]
	14	Kuck, D. J., Muraoka, Y., and Chen, S. On the number of operations simultaneously executable in FORTRAN-like programs and their resulting speed-up. IEEE Transactions on Computers C- 12, 12 (Dec. 1972).
	15	Eugene M. Myers, A precise inter-procedural data flow algorithm, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.219-230, January 26-28, 1981, Williamsburg, Virginia [doi>10.1145/567532.567556]
	16	Karl J. Ottenstein , Linda M. Ottenstein, The program dependence graph in a software development environment, ACM SIGPLAN Notices, v.19 n.5, p.177-184, May 1984
	17	Ryder, B. G. Constructing the call graph of a program. IEEE Trans. Softw. Eng. SE-5, 3 (May 1979), 216-226.
	18	Olin Grigsby Shivers, Control-flow analysis of higher-order languages of taming lambda, Carnegie Mellon University, Pittsburgh, PA, 1991
	19	Spillman, T. C. Exposing side-effets in a PL/I optimizing compiler. In Proceedings IFIPS (Computer Software) Conference (1971), pp. 56-60.
	20	Mark N. Wegman , F. Kenneth Zadeck, Constant propagation with conditional branches, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.2, p.181-210, April 1991 [doi>10.1145/103135.103136]
	21	William E. Weihl, Interprocedural data flow analysis in the presence of pointers, procedure variables, and label variables, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.83-94, January 28-30, 1980, Las Vegas, Nevada [doi>10.1145/567446.567455]

CITED BY 12

	Gail C. Murphy , David Notkin , Erica S.-C. Lan, An empirical study of static call graph extractors, Proceedings of the 18th international conference on Software engineering, p.90-99, March 25-29, 1996, Berlin, Germany
	Gail C. Murphy , David Notkin , William G. Griswold , Erica S. Lan, An empirical study of static call graph extractors, ACM Transactions on Software Engineering and Methodology (TOSEM), v.7 n.2, p.158-191, April 1998
	Maryam Emami , Rakesh Ghiya , Laurie J. Hendren, Context-sensitive interprocedural points-to analysis in the presence of function pointers, ACM SIGPLAN Notices, v.29 n.6, p.242-256, June 1994
	Michael Hind , Michael Burke , Paul Carini , Jong-Deok Choi, Interprocedural pointer alias analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.4, p.848-894, July 1999
	Vijay Sundaresan , Laurie Hendren , Chrislain Razafimahefa , Raja Vallée-Rai , Patrick Lam , Etienne Gagnon , Charles Godin, Practical virtual method call resolution for Java, ACM SIGPLAN Notices, v.35 n.10, p.264-280, Oct. 2000
	Hira Agrawal, Efficient coverage testing using global dominator graphs, ACM SIGSOFT Software Engineering Notes, v.24 n.5, p.11-20, Sept. 1999
	Thomas Reps , Susan Horwitz , Mooly Sagiv , Genevieve Rosay, Speeding up slicing, ACM SIGSOFT Software Engineering Notes, v.19 n.5, p.11-20, Dec. 1994
	David Grove , Greg DeFouw , Jeffrey Dean , Craig Chambers, Call graph construction in object-oriented languages, ACM SIGPLAN Notices, v.32 n.10, p.108-124, Oct. 1997
	Erik Trainer , Stephen Quirk , Cleidson de Souza , David Redmiles, Bridging the gap between technical and social dependencies with Ariadne, Proceedings of the 2005 OOPSLA workshop on Eclipse technology eXchange, p.26-30, October 16-17, 2005, San Diego, California
	David Grove , Craig Chambers, A framework for call graph construction algorithms, ACM Transactions on Programming Languages and Systems (TOPLAS), v.23 n.6, p.685-746, November 2001
	Baowen Xu , Ju Qian , Xiaofang Zhang , Zhongqiang Wu , Lin Chen, A brief survey of program slicing, ACM SIGSOFT Software Engineering Notes, v.30 n.2, March 2005
	Hemant D. Pande , Barbara G. Ryder, Static type determination for C++, Proceedings of the 6th conference on USENIX Sixth C++ Technical Conference, p.5-5, April 11-14, 1994, Cambridge, MA