Olin Shivers
- 1 Andrew Appel and Trevor Jim. Continuation-passing, closurepassing style. In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 293-302, January 1989. Google Scholar
Digital Library
- 2 Anders Bondorf. Automatic autoprojection of higher order recursive equations. ESOP '90, Neil Jones (editor). Springer- Verlag, May 1990. Google ScholarDigital Library
- 3 Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth Annual Symposium on Principles of Programming Languages, pages 238-252. Association of Computing Machinery, 1977. Google ScholarDigital Library
- 4 Paul Hudak. A semantic model of reference counting and its abstraction. In Proceedings of the 1986 ACM Conference on Lisp and Functional Programming, August 1986. Google ScholarDigital Library
- 5 Paul Hudak and Adrienne Bloss. Variations on strictness analysis. In Proceedings of the 1986 ACM Conference on LISP and Functional Programming, August 1986. Google ScholarDigital Library
- 6 David Kranz, et al. ORBIT: An optimizing compiler for Scheme. In Proceedings of the SIGPLAN '86 Symposium on Compiler Construction, published as SIGPLANNotices 21 (7), pages 219-233. Association for Computing Machinery, July 1986, Google ScholarDigital Library
- 7 John Reynolds, School of Computer Science, CMU. Personal communication.Google Scholar
- 8 Peter Sestoft. Replacing function parameters by global variables. Master's Thesis, University of Copenhagen, 1988. Student report 88-7-2, DIKU. A conference-length version of this thesis appears in the FPCA '89 Conference Proceedings, pages 39-53, September 1989. Google ScholarDigital Library
- 9 Olin Shivers. Control-flow analysis in Scheme. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, June 1988. Also available as Technical Report ERGO-88-60, CMU School of Computer Science, Pittsburgh, Penn. Google ScholarDigital Library
- 10 Olin Shivers. Control-Flow Analysis of Higher-Order Languages. Ph.D. Dissertation, CMU. (Forthcoming) Google ScholarDigital Library
- 11 Olin Shivers. Data-flow analysis and type recovery in Scheme. Technical Report CMU-CS-90-115. CMU School of Computer Science, Pittsburgh, Penn., March 1990. Also to appear in Topics in Advanced Language Implementation, Peter Lee (editor), M1T Press.Google Scholar
- 12 Olin Shivers. The semantics of Scheme control-flow analysis. In Proceedings of the First A CM SIGPLAN and IFIP Symposium on Partial Evaluation and Semantics-Based Program Manipulation, June 1991. To appear in SIGPLAN Notices. Also available as Technical Report CMU-CS-91-119, CMU School of Computer Science, Pittsburgh, Penn. An early version was available as Technical Report ERGO-90-090. Google ScholarDigital Library
- 13 Olin Shivers. Super-t: Copy, constant, and lambda propagation in Scheme. Working note #3, May 1990.Google Scholar
- 14 Olin Shivers. Useless-variable elimination. Working note #2, April 1990.Google Scholar
- 15 Guy L. Steele Jr. RABBIT: A Compiler for SCHEME. Technical Report 474, MIT AI Lab, May 1978. Google ScholarDigital Library
- 16 Jonathan Young and Paul Hudak. Finding fixpoints on function spaces. Research Report 505, Yale University, Department of Computer Science. December 1986.Google Scholar
Index Terms
- The semantics of Scheme control-flow analysis
Recommendations
Pushdown control-flow analysis for free
POPL '16Traditional control-flow analysis (CFA) for higher-order languages introduces spurious connections between callers and callees, and different invocations of a function may pollute each other's return flows. Recently, three distinct approaches have been ...
Control-flow analysis of dynamic languages via pointer analysis
DLS 2015: Proceedings of the 11th Symposium on Dynamic LanguagesWe demonstrate how to map a control-flow analysis for a higher-order language (dynamic languages are typically higher-order) into a pointer analysis for a first-order language, such as C. This allows us to use existing pointer analysis tools to perform ...
Pushdown control-flow analysis for free
POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesTraditional control-flow analysis (CFA) for higher-order languages introduces spurious connections between callers and callees, and different invocations of a function may pollute each other's return flows. Recently, three distinct approaches have been ...
Comments