Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
After ‘emptying’ the stack, the virus retrieves the return address from it, which points into kernel32.dll. The virus intends to… 
2008
2008
In this paper we present an analysis of assembly code for safety-critical embedded environments. Since local and global variables… 
2008
2008
Controlling resource usage is important for the reliability, efficiency and security of software systems. Automated analyses for… 
2005
2005
It is accepted that the alignment of a return-addressstack can be preserved by checkpointing on branches and recovering on branch… 
2005
2005
paper proposes a light-weight cooperative multi- threading programming model for an embedded multi- processor system. The… 
2001
2001
This thesis investigates the design and the correctness of a pointer analysis for the Java programming language. Although the… 
2000
2000
PURPOSE: A central processing unit capable of easily testing and debugging a program is provided to lower its price and to… 
1991
1991
Multiple lightweight processes or threads have multiple stacks, and a thread context switch moves execution from one stack to… 
1989
1989
Before the compiler can generate any code, you must set up a Compiler Information File (CIF). This is a small ASCII text file… 
1988
1988
In procedure oriented languages such as Pascal and C, the above addressing modes might be used to access data operands in the run…