Improving flow analyses via ΓCFA: Abstract garbage collection and counting

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn 2006, Issue , 2006, Pages 13-25

  Might, Matthew ^a   Shivers, Olin ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Abstract counting; Abstract garbage collection; Continuations; CPS; Environment analysis; Flow analysis; Functional languages; Gamma CFA; Inlining; Lambda calculus; Program analysis; Super beta

Indexed keywords

ABSTRACT COUNTING; ABSTRACT GARBAGE COLLECTION; ENVIRONMENT ANALYSIS; FUNCTIONAL LANGUAGES; GAMMA-CFA; LAMBDA CALCULUS; PROGRAM ANALYSIS; SUPER-BETA;

ABSTRACTING; FLOWCHARTING; INFORMATION MANAGEMENT; OPTIMIZATION; RESOURCE ALLOCATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 34247208154     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1159803.1159807     Document Type: Conference Paper

References (12)

1. AGESEN, O. The cartesian product algorithm: Simple and precise type inference of parametric polymorphism. In Proceedings of ECOOP 1995 (1995), pp. 2-26.
2. CHASE, D. R., WEGMAN, M., AND ZADECK, F. K. Analysis of Pointers and Structures. In ACM SIGPLAN Conference on Programming Language Design and Implementation (White Plains, New York, June 1990), pp. 296-310.
3. COUSOT, P., AND COUSOT, R. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In ACM SIGPLAN Symposium on Principles of Programming Languages (Los Angeles, California, Jan. 1977), vol. 4, pp. 238-252.
4. HANNAN, J. Type Systems for Closure Conversion. In Workshop on Types for Program Analysis (1995), pp. 48-62.
5. HUDAK, P. A semantic model of reference counting and its abstraction (detailed summary). In Proceedings of the 1986 ACM Conference on LISP and Functional Programming (Cambridge, Massachusetts, Aug. 1986), pp. 351-363.
6. JAOANNATHAN, S., THIEMANN, P., WEEKS, S., AND WRIGHT, A. K. Single and loving it: Must-alias analysis for higher-order languages. In ACM SIGPLAN Symposium on Principles of Programming Languages (San Diego, California, January 1998), pp. 329-341.
7. MIGHT, M., AND SHIVERS, O. Environment Analysis via ΔCFA. In ACM SIGPLAN Symposium on Principles of Programming Languages (Charleston, South Carolina, January 2006), pp. 127-140.
8. SHIVERS, O. Control-Flow Analysis of Higher-Order Languages. PhD thesis, School of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania, May 1991. Technical Report CMU-CS-91-145.
9. SHIVERS, O., AND MIGHT, M. Continuations and transducer composition. In ACM SIGPLAN Conference on Programming Language Design and Implementation (Ottawa, Canada, June 2006).
10. STEELE JR., G. L. RABBIT: a compiler for SCHEME. Master's thesis, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1978. Technical report AI-TR-474.
11. WAND, M., AND STECKLER, P. Selective and lightweight closure conversion. In ACM SIGPLAN Symposium on Principles of Programming Languages (Portland, Oregon, January 1994), vol. 21, pp. 435-445.
12. WRIGHT, A. K., AND JAGANNATHAN, S. Polymorphic splitting: An effective polyvariant flow analysis. ACM Transactions on Programming Languages and Systems 20, 1 (January 1998), 166-207.