Static check analysis for Java stack inspection
ACM SIGPLAN Notices2006Vol. 41(3), pp. 40–48
Citations Over TimeTop 13% of 2006 papers
Abstract
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.
Related Papers
- → A program data flow analysis procedure(1976)406 cited
- → Efficient and precise modeling of exceptions for the analysis of Java programs(1999)134 cited
- → Efficient and precise modeling of exceptions for the analysis of Java programs(1999)13 cited
- A Constraint-based Analysis Method to Simplify Control Flow Graph(2013)
- → Malicious behavior pattern mining using control flow graph(2015)