Stack-based memory allocation

Known as: 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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1962-2017
0246819622017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Stack allocation of objects reduces the cost of object allocation and garbage collection and can thus lead to large reductions in… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2008
2008
This paper presents an experimental study of the impact of soft errors in a prototype brake-by-wire system. To emulate the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2008
2008
Over the last seven years, we have developed static-analysis methods to recover a good approximation to the variables and… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 5
  • table 2
Is this relevant?
2006
2006
Stack allocation of objects offers more efficient use of cache memories on modern computers, but finding objects that can be… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2005
2005
Programmers obfuscate their code to defeat manual or automated analysis. Obfuscations are often used to hide malicious behavior… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
This paper describes an assembly-language type system capable of ensuring memory safety in the presence of both heap and stack… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This article presents an <i>escape analysis</i> framework for Java to determine (1) if an object is not reachable after its… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
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… (More)
Is this relevant?
1990
1990
The Scheme dialect of Lisp [9] is properly tail-recuraiwit relies entirely on procedure calls to express iteration. In Scheme, a… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?