Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,219,796 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Address space layout randomization
Application binary interface
Automatic variable
Buddy memory allocation
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Analysis of executables for WCET concerns
Andrea Flexeder
,
Michaela Petter
,
H. Seidl
2008
Corpus ID: 8109412
In this paper we present an analysis of assembly code for safety-critical embedded environments. Since local and global variables…
Expand
2008
2008
Type-based amortized stack memory prediction
Brian Campbell
2008
Corpus ID: 37421878
Controlling resource usage is important for the reliability, efficiency and security of software systems. Automated analyses for…
Expand
2008
2008
Detection techniques of format-string vulnerabilities in binary files
Tang Jiang
2008
Corpus ID: 62959247
Current detection techniques are mostly limited to the source code level, and research on the binary files is few. Based on the…
Expand
2008
2008
Risc processor device and method of simulating floating-point stack operation thereof
두안 웨이
,
리 시아오유
2008
Corpus ID: 209091601
A RISC processor device and a method of simulating floating-point stack operation thereof, the processor device comprises: a…
Expand
2006
2006
Securing Access to Libraries and Modules : The SecModule Framework
Jason W. Kim
,
V. Prevelakis
2006
Corpus ID: 17998858
Security policy enforcement and control over user programs traditionally operate by guarding the lowest level of the services…
Expand
2005
2005
Static Analysis for Identifying and Allocating Clusters of Immortal Objects
A. Ravindar
2005
Corpus ID: 17402922
Long living objects lengthen the trace time which is a critical phase of the garbage collection process. However, it is possible…
Expand
2005
2005
Correct Alignment of a Return-Address-Stack after Call and Return Mispredictions
V. Desmet
,
Yiannakis Sazeides
,
Constantinos Kourouyiannis
,
K. De Bosschere
International Symposium on Computer Architecture
2005
Corpus ID: 1910440
It is accepted that the alignment of a return-addressstack can be preserved by checkpointing on branches and recovering on branch…
Expand
2000
2000
Central processing unit for easily testing and debugging of program
경영 조
,
종윤 임
,
근택 이
,
상섭 한
,
병권 민
,
이희
2000
Corpus ID: 196061023
PURPOSE: A central processing unit capable of easily testing and debugging a program is provided to lower its price and to…
Expand
1991
1991
Register Windows and User-Space Threads on the SPARC
D. Keppel
1991
Corpus ID: 57803940
Multiple lightweight processes or threads have multiple stacks, and a thread context switch moves execution from one stack to…
Expand
1989
1989
Bit slice software: user retargetable microcode tools
P. Gurd
SIGM
1989
Corpus ID: 34433773
Before the compiler can generate any code, you must set up a Compiler Information File (CIF). This is a small ASCII text file…
Expand