Temporal Safety for Stack Allocated Memory on Capability Machines
Citations Over TimeTop 18% of 2019 papers
Abstract
Memory capabilities as supported in capability machines are very similar to fat pointers, and hence are very useful for the efficient enforcement of spatial memory safety. Enforcing temporal memory safety however, is more challenging. This paper investigates an approach to enforce temporal memory safety for stack-allocated memory in C-like languages by extending capabilities with a simple dynamic mechanism. This mechanism ensures that capabilities with a certain lifetime can only be stored in memory that has a longer lifetime. Our mechanism prevents temporal memory safety violations, yet is sufficiently permissive to allow typical C coding idioms where addresses of local variables are passed up the call stack. We formalize the desired behavior of a simple C-like language as a dependently typed operational semantics, and we show that existing compilers to capability machines do not simulate this desired behavior: they either have to break temporal safety, or they have to defensively rule out allowed behaviors. Finally, we show that with our proposed dynamic mechanism, our compiler is fully abstract.
Related Papers
- → Stack Computers: An Introduction(1977)15 cited
- → Maximum Stack Memory Monitoring Method Assisted by Static Analysis of the Stack Usage Profile(2017)1 cited
- → Use of stack simplifies M68HC11 programming(1992)1 cited
- LSTACK: Stata module to stack variables with labelled _stack(1998)
- → Two stack dynamic memory allocation(2002)