ACM Home Page
Please provide us with feedback. Feedback
Static check analysis for Java stack inspection
Full text PdfPdf (228 KB)
Source ACM SIGPLAN Notices archive
Volume 41 ,  Issue 3  (March 2006) table of contents
COLUMN: Technical correspondence table of contents
Pages: 40 - 48  
Year of Publication: 2006
ISSN:0362-1340
Author
Byeong-Mo Chang  Sookmyung Women's University, Yongsan-ku, Seoul, Korea
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 49,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1140543.1140550
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Bartoletti, P. Degano, and G. L. Ferrari. Static Analysis for Stack Inspection. Electr. Notes Theor. Comput. Sci. 54, 2001.
 
2
 
3
4
 
5
 
6
7
 
8
9
10
 
11
12
13
14
15
 
16