A tail-recursive semantics for stack inspections

DOI10.1007/3-540-36575-3_3MaRDI QIDQ4417880zbMATH OpenFDO

Authors J. C. Clements, Matthias Felleisen

Publication date 30 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2618/26180022.htm

Mathematics Subject Classification ID

Theory of programming languages (68N15) Data encryption (aspects in computer science) (68P25)

Recommendations

• Security-aware program transformations.
• Stack inspection
• A simple semantics and static analysis for stack inspection
• Selective tail call elimination
• Interfaces for stack inspection

Cited in

(11)

• Optimizing the stack size of recursive functions
• Improving the lazy Krivine machine
• A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
• Stack-based typed assembly language
• From Stack Traces to Lazy Rewriting Sequences
• Memory-efficient tail calls in the JVM with imperative functional objects
• Interfaces for stack inspection
• Selective tail call elimination
• StkTokens: enforcing well-bracketed control flow and stack encapsulation using linear capabilities
• Stack inspection
• Security-aware program transformations.

This page was built for publication: A tail-recursive semantics for stack inspections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417880)