ACM Home Page
Please provide us with feedback. Feedback
Analysis of pointers and structures
Full text PdfPdf (1.94 MB)
Source Conference on Programming Language Design and Implementation archive
Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation table of contents
White Plains, New York, United States
Pages: 296 - 310  
Year of Publication: 1990
ISBN:0-89791-364-7
Also published in ...
Authors
David R. Chase
Mark Wegman  IBM T. J. Watson Research Center, P.O. Box 704, Yorktown, Heights, NY
F. Kenneth Zadeck  Computer Science Dept., P.O. Box 1910, Brown University, Providence
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 208,   Citation Count: 153
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/93542.93585
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.

Ban79
Bar77
Bar78
 
BH88
H.-J. Boehm and L. Hederman. Storage allocation optimization in a compiler for Russell. Submitted for pubhcation, July 1988.
 
Bur87
M. Burke. An interval-based approach to exhaustive and incremental data flow analysis. Technical Report 12702, IBM, Yorktown Hts., New York, September 1987.
Cal88
CFR+89a
 
CFR+89b
R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegma,n, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. Technical Report RC 14756, IBM, July 1989.
CG77
 
Cha87
CK88
CK89
 
CWZ90
D.R. Chase, W. Wegman, and F. K. Zadeck. Fast insertion, deletion, and lookup in sparse ansestor trees. Technical Report CS-90-07, Dept. of Computer Sci., Brown U., March 1990.
DB76
Deu90
 
Hed88
L. Hederman. Compile time garbage collection. Mister's thesis, Dept. of Computer Sci., Rice U.. 1988.
 
HN89
L.J. Hendren and A. Nicolau. ParaUelizing programs with recursive data structures. Proc. 1989 International Conf. on Parallel Processing, II:49-56, 1989.
HPR89
Hud86
 
JM81
N.D. Jones and S. S. Muchnick. Flow analysis and optimization of LISP-like structures. In S. S. Muchnick and N. D. Jones, editors, Pro. grtzm Flow Analysis, chapter 4, pages 102-131. Prentice-Hall, 1981.
JM82
 
Lar89
LH88
Mye81
RM88
 
Rov85
P. Rovner. On adding garbage collection and runtime types to a strongly-typed, statically checked, concurrent language. Technical Report CSL-84-7, Xerox Palo Alto Research Center, Palo Alto, Ca. 94304, 1985.
 
Rug87
 
Sch75a
J.T. Schwartz. Optimization of very high level languages--I: Value transmission and its corollaries. Computer Languages, 1:161-194, 1975.
 
Sch75b
J.T. Schwartz. Optimization of very high level languages--II: Deducing relationships of inclusion and membership. Computer Languages, 1:197-218, 1975.
SCN84
 
Str88
J. Stransky. Analyse semantique de structures de donn4es dynamiques avec application au cas particulier de langages LISPiens. PhD thesis, Universitate de Paris-Sud, Centre d'Orsay, June 1988.
 
Weg75
B. Wegbreit. Property extraction in wellfounded property sets. IEEE Trans. on Software Engineering, SE-1(3):270-285, September 1975.
 
WZ88

CITED BY  153

Collaborative Colleagues:
David R. Chase: colleagues
Mark Wegman: colleagues
F. Kenneth Zadeck: colleagues