Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Interprocedural pointer alias analysis
Hind M., Burke M., Carini P., Choi J. ACM Transactions on Programming Languages and Systems21 (4):848-894,1999.Type:Article
Date Reviewed: Mar 1 2000

Three different algorithms for dataflow analysis of computer programs are presented. Compilers for programming languages that support dynamically allocated data structures, such as C, C++, Fortran 90, Java, and LISP need to make worst-case decisions about the allocation of space for the data structures. The authors hope that the results of dataflow analysis of a wide variety of typical programs like those presented can be used by compiler builders to make more efficient storage allocation decisions. The two classes of algorithms discussed are labeled “flow-sensitive” and “flow-insensitive.” A third variation of flow-insensitive uses information about when variables are “killed” to improve efficiency. The paper’s extensive bibliography makes it a good starting point from which to learn more about this subject.

Reviewer:  J. W. Snively Review #: CR122774 (0003-0190)
Bookmark and Share
 
Memory Management (Garbage Collection) (D.3.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Memory Management (Garbage Collection)": Date
Hardware support for real-time embedded multiprocessor system-on-a-chip memory management
Shalan M., Vincent J I.  Hardware/software codesign (Proceedings of the tenth international symposium, Estes Park, Colorado, May 6-8, 2002)79-84, 2002. Type: Proceedings
Jan 30 2004
Memory as a programming concept in C and C++
Franek F., Cambridge University Press, New York, NY, 2003.  250, Type: Book (9780521520430)
Apr 30 2004
Myths and realities: the performance impact of garbage collection
Blackburn S., Cheng P., McKinley K.  Measurement and modeling of computer systems (Proceedings of the joint international conference, New York, NY, USA, Jun 10-14, 2004)25-36, 2004. Type: Proceedings
Sep 7 2004
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy