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

Call stack

Known as: Runtime stack, Function stack, Display register 
In computer science, a call stack is a stack data structure that stores information about the active subroutines of a computer program. This kind of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Software often crashes. Once a crash happens, a crash report could be sent to software developers for investigation upon user… Expand
  • table I
  • figure 1
  • figure 3
  • figure 2
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
A widely shared belief in the software engineering community is that stack traces are much sought after by developers to support… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
A large amount of popular content is transferred repeatedly across network links in the Internet. In recent years, protocol… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Wireless IEEE 802.11 networks in residences, small businesses, and public "hot spots" typically encounter the wireline access… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The call stack of a program execution can be a very good information source for intrusion detection. There is no prior work on… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Conventional Security have relied on overwriting the saved return pointer on the stack to hijack the path of execution. Under Sun… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
  • Yin Zhang, Vern Paxson
  • USENIX Security Symposium
  • 2000
  • Corpus ID: 1289392
One widely-used technique by which network attackers attain anonymity and complicate their apprehension is by employing stepping… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Propagation-based call graph construction algorithms have been studied intensively in the 199Os, and differ primarily in the… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The Priority Ceiling Protocol (PCP) of Sha, Rajkumar and Lehoczky is a policy for locking binary semaphores that bounds priority… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 8
Is this relevant?