Static check analysis for Java stack inspection
Static check analysis for Java stack inspection
复制标题
Java堆栈检查的静态检查分析
DOI：
10.1145/1140543.1140550
复制
发表时间：
2006
影响因子：
--
通讯作者：
Byeong
中科院分区：
文献类型：
--
作者：
Byeong
大多数用于优化堆栈检查的静态分析技术都近似于权限集，例如授予的权限和拒绝的权限。由于权限集的计算遵循控制流，因此它们通常将过程内控制流以及调用关系考虑在内。在本文中，我们观察到，有必要对堆栈检查进行更精确的优化，以计算检查而不是权限的更具体的信息。我们提出了一个向后静态分析的基础上简单的调用图近似冗余的权限检查，必须失败。以类似的方式，我们还提出了一个向后的静态分析，以近似成功的权限检查，必须通过堆栈检查。
Most static analysis techniques for optimizing stack inspection approximate permission sets such as granted permissions and denied permissions. Because they compute permission sets following control flow, they usually take intra-procedural control flow into consideration as well as call relationship. In this paper, we observed that it is necessary for more precise optimization on stack inspection to compute more specific information on checks instead of permissions. We propose a backward static analysis based on simple call graph to approximate redundant permission checks which must fail. In a similar way, we also propose a backward static analysis to approximate success permission checks, which must pass stack inspection.