Stack inspection: Theory and variants

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2002, Pages 307-318

  Fournet, Cédric ^a   Gordon, Andrew D ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA ACQUISITION; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; RESPONSE TIME (COMPUTER SYSTEMS); SEMANTICS;

ACCESS CONTROL; RUN TIME; STACK INSPECTION;

SECURITY OF DATA;

EID: 0036041144     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Analysis and caching of dependencies
2. Full abstraction in the lazy lambda calculus
3. A simple semantics and static analysis for Java security
4. Representation independence, confinement, and access control
5. Static analysis for stack inspection
6. Compiling standard ML to Java bytecodes
7. Model checking security properties of control flow graphs
8. IRM enforcement of Java stack inspection
9. Stack inspection: Theory and variants
10. Syntactic type abstraction
11. The confused deputy
12. Proving congruence of bisimulation in functional programming languages
13. Verification of control flow based security properties
14. An operational semantics for Java 2 access control
15. Security properties of typed applets
16. Fully abstract models of type lambda-calculi
17. Notions of computations and monads
18. JFlow: Practical, mostly-static information flow control
19. Trust in the λ-calculus
20. Call-by-name, call-by-value and the λ-calculus
21. A systematic approach to access control
22. Tail call elimination on the Java virtual machine
23. Static enforcement of security with types
24. Safkasi: A security mechanism for language-based systems