skip to main content
10.1145/1111037.1111049acmconferencesArticle/Chapter ViewAbstractPublication PagespoplConference Proceedingsconference-collections
Article

Environment analysis via ΔCFA

Published:11 January 2006Publication History

ABSTRACT

We describe a new program-analysis framework, based on CPS and procedure-string abstractions, that can handle critical analyses which the k-CFA framework cannot. We present the main theorems concerning correctness, show an application analysis, and describe a running implementation.

References

  1. COUSOT,P., AND COUSOT, R. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth ACM Symposium on Principles of Programming Languages (POPL) (Los Angeles, California, Jan. 1977), pp. 238--252. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. COUSOT,P., AND COUSOT, R. Systematic design of program analysis frameworks. In Proceedings of the Sixth ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (San Antonio, Texas, Jan. 1979), pp. 269--282. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. HARRISON, W. L. The interprocedural analysis and automatic parallelization of Scheme programs. Lisp and Symbolic Computation 2, 3/4 (Oct. 1989), 179--396.Google ScholarGoogle ScholarCross RefCross Ref
  4. HUDAK, P. A semantic model of reference counting and its abstraction (detailed summary). In Proceedings of the 1986 ACMConference on LISP and Functional Programming (Cambridge, Massachusetts, Aug. 1986), pp. 351--363. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. KRANZ, D., KELSEY, R., REES, J., HUDAK,P.,PHILBIN, J., AND ADAMS, N. ORBIT: An optimizing compiler for Scheme. In Proceedings of the 1986 SIGPLAN Symposium on Compiler Construction (June 1986), vol. 21, pp. 219--233. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. MIGHT, M., AND SHIVERS, O. Environmental analysis of higher-order languages. In preparation. Current draft available at http://matt.might.net/research/drafts/, July 2005.Google ScholarGoogle Scholar
  7. MOSSIN,C. Flow Analysis of Typed Higher-Order Programs. PhD thesis, DIKU, University of Copenhagen, Denmark, 1997. Technical Report DIKU-TR-97/1.Google ScholarGoogle Scholar
  8. SESTOFT, P. Replacing function parameters by global variables. Master's thesis, DIKU, University of Copenhagen, Denmark, Oct. 1988.Google ScholarGoogle Scholar
  9. SHARIR, M., AND PNUELI, A. Two approaches to interprocedural data flow analysis. In Program Flow Analysis, Theory and Application, S. Muchnick and N. Jones, Eds. Prentice Hall International, 1981, ch. 7.Google ScholarGoogle Scholar
  10. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. SHIVERS, O., AND FISHER, D. Multi-return function call. Journal of Functional Programming. To appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. STECKLER,P.,AND WAND, M. Selective thunkification. In Proceedings of the First International Static Analysis Symposium (SAS'94) (Namur, Belgium, Sept. 1994), vol. 864 of Lecture Notes in Computer Science, Springer, pp. 162--178.Google ScholarGoogle ScholarCross RefCross Ref
  13. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. WAND, M., AND SIVERONI, I. Constraint systems for useless-variable elimination. In Proceedings of the 26th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'99) (San Antonio, Texas, Jan. 1999), pp. 291--302. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. WAND, M., AND STECKLER, P. Selective and lightweight closure conversion. In Proceedings of the 21st ACM Symposium on the Principles of Programming Languages (POPL'94) (Portland, Oregon, Jan. 1994), pp. 435--445. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Environment analysis via ΔCFA

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!