David R. Chase
- Ban79.J.B. Banning. An efficient way to find the side effects of procedure calls and the aliases of variables. Conf. Rec. Sixth A CM Sgtmp. on Principles of Programmin# Languages, pages 29-41, January 1979. Google Scholar
Digital Library
- Bar77.J.M. Barth. Shifting garbage collection overhead to compile time. Comm. A CM, 20(7):513- 518, July 1977. Google ScholarDigital Library
- Bar78.J.M. Barth. A practical interprocedural data flow analysis algorithm. Comm. A CM, 21(9):724-736, September 1978. Google ScholarDigital Library
- BH88.H.-J. Boehm and L. Hederman. Storage allocation optimization in a compiler for Russell. Submitted for pubhcation, July 1988.Google Scholar
- Bur87.M. Burke. An interval-based approach to exhaustive and incremental data flow analysis. Technical Report 12702, IBM, Yorktown Hts., New York, September 1987.Google Scholar
- Cal88.D. Callahan. The program summary graph and flow-sensitive interprocedural data flow analysis. Proc. SIGPLAN'88 S!lmp. on Compiler Construction, 23(7):47-56, July 1988. Google ScholarDigital Library
- CFR+89a.R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F. K. Zadcck. An efficient method of computing static single assignment form. Conf. Rec. Sixteenth A CM Sgtmp. on Principles of Pro#rammin9 Languages, pages 25-35, January 1989. Google ScholarDigital Library
- 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.Google ScholarDigital Library
- CG77.D.W. Clark and C. C. Green. An empirical study of list structure in LISP. Comm. A CM, 20(2):78-87, February 1977. Google ScholarDigital Library
- Cha87.D.R. Chase. Garbage Collection and Other Optimizations. PhD thesis, Dept. of Computer Sci., Rice U., August 1987. Google ScholarDigital Library
- CK88.K.D. Cooper and K. Kennedy. Interprocedural side-effect analysis in linear time. Proc. SIGPLAN'88 Syrup. on Compiler Construction, pages 57-66, June 1988. Published as SiG- PLAN Notices Vol. 23, Num. 7. Google ScholarDigital Library
- CK89.K.D. Cooper and K. W. Kennedy. Fast interprocedural alias analysis. Con/. Rec. Sixteenth ACM Syrup. on Principles of Programming Languages, pages 49-59, January 1989. Austin, Texas. Google ScholarDigital Library
- 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.Google Scholar
- DB76.L. Peter Deutsch and Daniel G. Bobrow. An efficient, incremental, automatic garbage collectol. Comm. A CM, 19(9):522-526, September 1976. Google ScholarDigital Library
- Deu90.A. Deutsch. On determining lifetime and aliasing of dynamically allocated data in higherorder functional specifications. Conf. Rec. Seventeenth A CM Syrup. on Principles of Programming Languages, pages 157-168, January 1990. Google ScholarDigital Library
- Hed88.L. Hederman. Compile time garbage collection. Mister's thesis, Dept. of Computer Sci., Rice U. 1988.Google Scholar
- HN89.L.J. Hendren and A. Nicolau. ParaUelizing programs with recursive data structures. Proc. 1989 International Conf. on Parallel Processing, II:49-56, 1989.Google Scholar
- HPR89.S. Horwitz, P. Pfeiffer, and T. Reps. Dependence analysis for pointer variables. Proc. SIGPLAN'89 Syrup. on Compiler Construction, June 1989. Published as SIGPLAN Notices Vol. 24 Num. 7. Google ScholarDigital Library
- Hud86.P. Hudgk. A semantic model of reference counting and its abstraction. In SIGPLAN Symposium on LISP and Functional Programming, pages 351-363, 1986. Google ScholarDigital Library
- 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.Google Scholar
- JM82.N.D. Jones and S. S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. Cc,nf. Rec. Ninth A CM Syrup. on Principles of Programming Languages, January 1982. Google ScholarDigital Library
- Lar89.J.R. Larus. Restructuring symbolic programs for concurrent execution on multiprocessors. Technical Report UCB/CSD 89/502, Computer Sc{. Dept., U. of California at Berkeley, Berkeley, CA, May 1989. Google ScholarDigital Library
- LH88.J.R. Larus and P. N. Hilfinger. Detecting conflicts between structure accesses. Proc. SIGPLAN'88 Syrup. on Compiler Construction, pages 21-34, July 1988. Published as SIGPLAN Notices Vol. 23, Num. 7. Google ScholarDigital Library
- Mye81.E.W. Myers. A precise interprocedural data flow algorithm. Conf. Rec. Eighth A CM Syrup. on Principles of Programming Languages, pages 219-230, January 1981. Google ScholarDigital Library
- RM88.C. Ruggieri and T. P. Murtagh. Lifetime analysis of dynamically allocated objects. Conf. Rec. Fifteenth A CM Syrup. on Principles of Programming Languages, pages 285-293, January 1988. Google ScholarDigital Library
- 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.Google Scholar
- Rug87.C. Ruggieri. Dynamic Memory Allocation Tech. niques Based on the Lifetimes of Objects. PhD thesis, Purdue University, August 1987. Google ScholarDigital Library
- Sch75a.J.T. Schwartz. Optimization of very high level languages--I: Value transmission and its corollaries. Computer Languages, 1:161-194, 1975.Google ScholarDigital Library
- Sch75b.J.T. Schwartz. Optimization of very high level languages--II: Deducing relationships of inclusion and membership. Computer Languages, 1:197-218, 1975.Google ScholarDigital Library
- SCN84.W.R. Stoye, T. J. W. Clarke, and A. C. Norman. Some practical methods for rapid combinator reduction. SIGPLAN Symposium on LISP and Functional Programming, pages 159-166, 1984. Google ScholarDigital Library
- 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.Google Scholar
- Weg75.B. Wegbreit. Property extraction in wellfounded property sets. IEEE Trans. on Software Engineering, SE-1(3):270-285, September 1975.Google ScholarDigital Library
- WZ88.M.N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. Technical Report CS-88-02, Dept. of Computer Sci., Brown U., February 1988. Google ScholarDigital Library
Index Terms
- Analysis of pointers and structures
Recommendations
Symbolic range analysis of pointers
CGO '16: Proceedings of the 2016 International Symposium on Code Generation and OptimizationAlias analysis is one of the most fundamental techniques that compilers use to optimize languages with pointers. However, in spite of all the attention that this topic has received, the current state-of-the-art approaches inside compilers still face ...
Interprocedural may-alias analysis for pointers: beyond k-limiting
Existing methods for alias analysis of recursive pointer data structures are based on two approximation techniques: k-limiting, and store-based (or equivalently location or region-based) approximations, which blur distinction between elements of ...
Practical Integrated Analysis of Pointers, Dataflow and Control Flow
This article presents a family of static analyses to determine pointer targets, control flow, and dataflow in combination. The integrated solution to these mutually dependent problems approaches the result from the optimistic side. It is a general ...
Comments