Notions of computation and monads
Information and Computation
Full abstraction in the lazy lambda calculus
Information and Computation
Proving congruence of bisimulation in functional programming languages
Information and Computation
Analysis and caching of dependencies
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Compiling standard ML to Java bytecodes
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
JFlow: practical mostly-static information flow control
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher order operational techniques in semantics
Higher order operational techniques in semantics
Inside Java 2 platform security architecture, API design, and implementation
Inside Java 2 platform security architecture, API design, and implementation
Static enforcement of security with types
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
SAFKASI: a security mechanism for language-based systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Representation independence, confinement and access control [extended abstract]
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Stack inspection: theory and variants
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking security properties of control flow graphs
Journal of Computer Security
Java Virtual Machine Specification
Java Virtual Machine Specification
.NET framework security
Essential .NET: The Common Language Runtime
Essential .NET: The Common Language Runtime
An Operational Semantics of Java 2 Access Control
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
The Confused Deputy: (or why capabilities might have been invented)
ACM SIGOPS Operating Systems Review
IRM Enforcement of Java Stack Inspection
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Policy framings for access control
WITS '05 Proceedings of the 2005 workshop on Issues in the theory of security
A framework for concrete reputation-systems with applications to history-based access control
Proceedings of the 12th ACM conference on Computer and communications security
Static check analysis for Java stack inspection
ACM SIGPLAN Notices
Theoretical Computer Science - Applied semantics: Selected topics
A syntactic correspondence between context-sensitive calculi and abstract machines
Theoretical Computer Science
Reasoning about safety properties in a JVM-like environment
Science of Computer Programming
AspectML: A polymorphic aspect-oriented functional programming language
ACM Transactions on Programming Languages and Systems (TOPLAS)
A logical framework for history-based access control and reputation systems
Journal of Computer Security
Local policies for resource usage analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
An implementation and semantics for transactional memory introspection in Haskell
Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security
Jalapa: Securing Java with Local Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Method-Specific Java Access Control via RMI Proxy Objects Using Annotations
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
Program Transformations under Dynamic Security Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Types and Effects for resource usage analysis
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Visualization of permission checks in java using static analysis
WISA'06 Proceedings of the 7th international conference on Information security applications: PartI
Role-based access control (RBAC) in Java via proxy objects using annotations
Proceedings of the 15th ACM symposium on Access control models and technologies
Exploiting modular access control for advanced policies
Proceedings of the tenth international conference on Aspect-oriented software development companion
Checking risky events is enough for local policies
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Higher-order program verification and language-based security
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
History-based access control and secure information flow
CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
History-based access control with local policies
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
V→M: a virtual machine for strict evaluation of (co) recursive functions
IFL'04 Proceedings of the 16th international conference on Implementation and Application of Functional Languages
Discretionary capability confinement
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
TreeDroid: a tree automaton based approach to enforcing data processing policies
Proceedings of the 2012 ACM conference on Computer and communications security
Secure and modular access control with aspects
Proceedings of the 12th annual international conference on Aspect-oriented software development
Hi-index | 0.01 |
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.