Stack inspection
- 1 May 2003
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 25 (3) , 360-399
- https://doi.org/10.1145/641909.641912
Abstract
Stack inspection is a security mechanism implemented in runtimes such as the JVM and the CLR to accommodate components with diverse levels of trust. Although stack inspection enables the fine-grained expression of access control policies, it has rather a complex and subtle semantics. We present a formal semantics and an equational theory to explain how stack inspection affects program behavior and code optimisations. We discuss the security properties enforced by stack inspection, and also consider variants with stronger, simpler properties.Keywords
This publication has 11 references indexed in Scilit:
- Model checking security properties of control flow graphsJournal of Computer Security, 2001
- A Systematic Approach to Static Access ControlPublished by Springer Nature ,2001
- Syntactic type abstractionACM Transactions on Programming Languages and Systems, 2000
- Security Properties of Typed AppletsPublished by Springer Nature ,1999
- Proving Congruence of Bisimulation in Functional Programming LanguagesInformation and Computation, 1996
- Full Abstraction in the Lazy Lambda CalculusInformation and Computation, 1993
- Notions of computation and monadsInformation and Computation, 1991
- The Confused DeputyACM SIGOPS Operating Systems Review, 1988
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975