|
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
|
R. Cytron , J. Ferrante , B. K. Rosen , M. N. Wegman , F. K. Zadeck, An efficient method of computing static single assignment form, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.25-35, January 11-13, 1989, Austin, Texas, United States
[doi> 10.1145/75277.75280]
|
| |
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
|
S. Horwitz , P. Pfeiffer , T. Reps, Dependence analysis for pointer variables, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.28-40, June 19-23, 1989, Portland, Oregon, United States
|
 |
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
|
W. R. Stoye , T. J. W. Clarke , A. C. Norman, Some practical methods for rapid combinator reduction, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.159-166, August 06-08, 1984, Austin, Texas, United States
[doi> 10.1145/800055.802032]
|
| |
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
|
|
|
|
|
Hemant D. Pande , William Landi, Interprocedural Def-Use associations in C programs, Proceedings of the symposium on Testing, analysis, and verification, p.139-153, October 08-10, 1991, Victoria, British Columbia, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
William Y. Chen , Scott A. Mahlke , Wen-mei W. Hwu , Tokuzo Kiyohara , Pohua P. Chang, Tolerating data access latency with register preloading, Proceedings of the 6th international conference on Supercomputing, p.104-113, July 19-24, 1992, Washington, D. C., United States
|
|
|
|
|
|
Jon Loeliger , Robert Metzger , Mark Seligman , Sean Stroud, Pointer target tracking—an empirical study, Proceedings of the 1991 ACM/IEEE conference on Supercomputing, p.14-23, November 18-22, 1991, Albuquerque, New Mexico, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Bogong Su , Stanley Habib , Wei Zhao , Jian Wang , Youfeng Wu, A study of pointer aliasing for software pipelining using run-time disambiguation, Proceedings of the 27th annual international symposium on Microarchitecture, p.112-117, November 30-December 02, 1994, San Jose, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Mooly Sagiv , Thomas Reps , Reinhard Wilhelm, Solving shape-analysis problems in languages with destructive updating, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.16-31, January 21-24, 1996, St. Petersburg Beach, Florida, United States
|
|
|
|
|
|
Hiralal Agrawal , Richard A. DeMillo , Eugene H. Spafford, Dynamic slicing in the presence of unconstrained pointers, Proceedings of the symposium on Testing, analysis, and verification, p.60-73, October 08-10, 1991, Victoria, British Columbia, Canada
|
|
|
Saumya Debray , Robert Muth , Matthew Weippert, Alias analysis of executable code, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.12-24, January 19-21, 1998, San Diego, California, United States
|
|
|
|
|
|
Christian Collberg , Clark Thomborson , Douglas Low, Manufacturing cheap, resilient, and stealthy opaque constructs, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.184-196, January 19-21, 1998, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Mooly Sagiv , Thomas Reps , Reinhard Wilhelm, Parametric shape analysis via 3-valued logic, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.105-118, January 20-22, 1999, San Antonio, Texas, United States
|
|
|
|
|
|
Rakesh Ghiya , Laurie J. Hendren, Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-15, January 21-24, 1996, St. Petersburg Beach, Florida, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Suresh Jagannathan , Peter Thiemann , Stephen Weeks , Andrew Wright, Single and loving it: must-alias analysis for higher-order languages, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.329-341, January 19-21, 1998, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Stephen Fink , Eran Yahav , Nurit Dor , G. Ramalingam , Emmanuel Geay, Effective typestate verification in the presence of aliasing, Proceedings of the 2006 international symposium on Software testing and analysis, July 17-20, 2006, Portland, Maine, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ju Qian , Baowen Xu , Hongbo Min, Interstatement must aliases for data dependence analysis of heap locations, Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, p.17-24, June 13-14, 2007, San Diego, California, USA
|
|
|
|
|
|
Mark Marron , Darko Stefanovic , Manuel Hermenegildo , Deepak Kapur, Heap analysis in the presence of collection libraries, Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, p.31-36, June 13-14, 2007, San Diego, California, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Thomas J. Marlowe , William G. Landi , Barbara G. Ryder , Jong-Deok Choi , Michael G. Burke , Paul Carini, Pointer-induced aliasing: a clarification, ACM SIGPLAN Notices, v.28 n.9, p.67-70, Sept. 1993
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Mark Marron , Mario Méndez-Lojo , Manuel Hermenegildo , Darko Stefanovic , Deepak Kapur, Sharing analysis of arrays, collections, and recursive structures, Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, November 09-10, 2008, Atlanta, Georgia
|
|
|
|
|
|
|
|
|
|
|
|
|
|