CFA2:一种上下文无关的控制流分析方法
CFA2: a Context-Free Approach to Control-Flow Analysis
摘要:
在函数式语言中,主要的控制流机制是函数调用和返回。大多数高阶流分析,包括k-CFA,不能很好地处理调用和返回:它们只记住有限数量的挂起调用,因为它们用控制流图来近似程序。调用/返回不匹配会引入降低精度的虚假控制流路径,并增加分析时间。我们描述CFA2,第一个流分析与精确的调用/返回匹配的高阶函数和尾部调用的存在。我们制定CFA2作为一个抽象的解释程序在继续通过风格,并描述了一个声音和完整的摘要算法,我们的抽象语义。初步评估表明,CFA2比0CFA和1CFA提供更准确的数据流信息。
英文摘要:
In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and return well: they remember only a bounded number of pending calls because they approximate programs with control-flow graphs. Call/return mismatch introduces precision-degrading spurious control-flow paths and increases the analysis time. We describe CFA2, the first flow analysis with precise call/return matching in the presence of higher-order functions and tail calls. We formulate CFA2 as an abstract interpretation of programs in continuation-passing style and describe a sound and complete summarization algorithm for our abstract semantics. A preliminary evaluation shows that CFA2 gives more accurate data-flow information than 0CFA and 1CFA.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。