Affiliation:
1. University of Utah, USA
Abstract
Flow-driven higher-order inlining is blocked by free variables, yet current theories of environment analysis cannot reliably cope with multiply-bound variables. One of these, Δ
CFA
, is a promising theory based on stack change but is undermined by its finite-state model of the stack. We present Pushdown Δ
CFA
which takes a Δ
CFA
-approach to pushdown models of control flow and can cope with multiply-bound variables, even in the face of recursion.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献