Static check analysis for Java stack inspection
- Authors
- Chang, Byeong-Mo
- Issue Date
- Mar-2006
- Publisher
- ASSOC COMPUTING MACHINERY
- Keywords
- java; stack inspection; security; static analysis
- Citation
- ACM SIGPLAN NOTICES, v.41, no.3, pp 40 - 48
- Pages
- 9
- Journal Title
- ACM SIGPLAN NOTICES
- Volume
- 41
- Number
- 3
- Start Page
- 40
- End Page
- 48
- URI
- https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/15175
- DOI
- 10.1145/1140543.1140550
- ISSN
- 0362-1340
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 공과대학 > 소프트웨어학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.