A Tail-Recursive Semantics for Stack Inspections

@inproceedings{Clements2003ATS,
  title={A Tail-Recursive Semantics for Stack Inspections},
  author={John Clements and M. Felleisen},
  booktitle={ESOP},
  year={2003}
}
Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy. An implementation of such a language may have to allocate memory for a source-code tail call, and a program that uses only tail calls (and no other memory-allocating construct) may nevertheless exhaust the available memory. In this paper, we prove this widely held belief wrong. We exhibit an abstract machine for a language with security stack inspection whose… Expand
From stack inspection to access control: a security analysis for libraries
A static type system for JVM access control
A static type system for JVM access control
A syntactic correspondence between context-sensitive calculi and abstract machines
Type annotations to improve stack-based access control
  • Tian Zhao, J. Boyland
  • Computer Science
  • 18th IEEE Computer Security Foundations Workshop (CSFW'05)
  • 2005
...
1
2
3
...

References

SHOWING 1-10 OF 33 REFERENCES
Stack inspection: Theory and variants
Static enforcement of security with types
Proper tail recursion and space efficiency
A systematic approach to static access control
Compiling standard ML to Java bytecodes
Revised5 Report on the Algorithmic Language Scheme
Revised5 report on the algorithmic language scheme
Extensible security architectures for Java
...
1
2
3
4
...