The Interprocedural Coincidence Theorem
The Interprocedural Coincidence Theorem
复制标题
过程间符合定理
DOI：
--
复制
发表时间：
1992
期刊：
影响因子：
--
通讯作者：
B. Steffen
中科院分区：
文献类型：
--
作者：
J. Knoop;B. Steffen
我们对Kam和Ullman著名的（过程内）重合定理进行了过程间推广，该定理为数据流分析问题的所有路径相交（MOP）解和最大不动点（MFP）解的等价性提供了充分条件。这种推广涵盖了具有递归过程、全局和局部变量以及形式值参数的任意命令式程序。在没有程序的情况下，它简化为经典的程序内版本。特别是，我们的堆栈为基础的方法概括了重合定理的巴特和Sharir/Pnueli相同的设置，不适当地处理局部变量的递归程序。
We present an interprocedural generalization of the well-known (intraprocedural) Coincidence Theorem of Kam and Ullman, which provides a sufficient condition for the equivalence of the meet over all paths (MOP) solution and the maximal fixed point (MFP) solution to a data flow analysis problem. This generalization covers arbitrary imperative programs with recursive procedures, global and local variables, and formal value parameters. In the absence of procedures, it reduces to the classical intraprocedural version. In particular, our stack-based approach generalizes the coincidence theorems of Barth and Sharir/Pnueli for the same setup, which do not properly deal with local variables of recursive procedures.