Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Stack-based memory allocation

Known as: Stack, Stack allocation 
In most modern computer systems, each thread has a reserved region of memory referred to as its stack. When a function executes, it may add some of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
This paper presents component techniques essential for converting executables to a high-level intermediate representation (IR) of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2008
2008
We analyze: (i) use of virtualization to facilitate fault injection into non-virtualized systems, and (ii) use of fault injection… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
2003
Highly Cited
2003
Escape analysis is a static analysis that determines whether the lifetime of data may exceed its static scope.This paper first… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Highly Cited
2003
Highly Cited
2003
This article presents an escape analysis framework for Java to determine (1) if an object is not reachable after its method of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2002
Highly Cited
2002
Cyclone is a type-safe programming language derived from C. The primary design goal of Cyclone is to let programmers control data… Expand
  • figure 3
  • table 1
  • table 2
Highly Cited
1999
Highly Cited
1999
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction… Expand
  • figure 1
Highly Cited
1998
Highly Cited
1998
In previous work, we presented a Typed Assembly Language (TAL). TAL is sufficiently expressive to serve as a target language for… Expand
  • figure 11
1991
1991
Multiple lightweight processes or threads have multiple stacks, and a thread context switch moves execution from one stack to… Expand
  • figure 4
  • figure 9
  • figure 10
  • figure 11
  • figure 17
Highly Cited
1990
Highly Cited
1990
Dynamic storage‐management algorithms are based either on object sizes or object lifetimes. Stack allocation, which is based on… Expand
Highly Cited
1986
Highly Cited
1986
1 Introduction 1.1 Language Processors 1.2 The Structure of a Compiler 1.3 The Evolution of Programming Languages 1.4 The Science… Expand