不变关系:连接程序与方程的桥梁
Invariant Relations: A Bridge from Programs to Equations
AI总结:
针对程序分析中循环函数推导困难、循环展开法不足的问题,提出基于不变关系的方法,可推导含任意嵌套循环的类C程序的函数。
摘要:
若能推导程序从输入到输出(或从初始状态到最终状态,取决于我们对程序语义的建模方式)的函数,程序分析将取得重大进展。此类研究一直因推导循环函数的难度而停滞;通过任意次数展开循环来获取循环函数的权宜之计显然不够充分。本文提出一种基于关系的方法,用于推导类C程序的函数,包括具有任意嵌套层级循环的程序。我们采用不变关系的概念来刻画循环的语义。
英文摘要:
Great advances in program analysis would be enabled if it were possible to derive the function of a program from inputs to outputs (or from initial states to final states, depending on how we model program semantics). Efforts to do so have always stalled against the difficulty to derive the function of loops; the expedient solution to capture the function of loops by unrolling them an arbitrary number of iterations is clearly inadequate. In this paper, we propose a relations-based method to derive the function of a C-like program, including programs that have loops nested to an arbitrary level. To capture the semantics of loops, we use the concept of invariant relation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。