Paper Info
Title
A Simple Semantics And Static Analysis For Stack Inspection
Abstract
The Java virtual machine and the. NET common language runtime feature an access control mechanism specified operationally in terms of run-time stack inspection. We give a denotational semantics in "eager" form, and show that it is equivalent to the "lazy" semantics using stack inspection. We give a static analysis of safety, i.e., the absence of security errors, that is simpler than previous proposals. We identify several program transformations that can be used to remove run-time checks. We give complete, detailed proofs for safety of the analysis and for the transformations, exploiting compositionality of the eager semantics.
Year
DOI
Venue
2013
10.4204/EPTCS.129.17
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE
Field
DocType
Issue
Principle of compositionality,Operational semantics,Programming language,Computer science,Denotational semantics,Static analysis,Theoretical computer science,Mathematical proof,Common Language Runtime,Semantics,Well-founded semantics
Journal
129
ISSN
Citations 
PageRank 
2075-2180
0
0.34
References 
Authors
13
2
Name
Order
Citations
PageRank
Anindya Banerjee1132470.68
David Naumann2110184.12