Dangling pointer

Known as: Use-after-free, Dangling pointers, Wild reference 
Dangling pointers and wild pointers in computer programming are pointers that do not point to a valid object of the appropriate type. These are… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1969-2018
0102019692018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Many system components and network applications are written in languages that are prone to memory corruption vulnerabilities… (More)
  • table I
  • table II
  • figure 2
  • table III
  • table IV
Is this relevant?
2015
2015
Lack of memory safety in C/C++ has resulted in numerous security vulnerabilities and serious bugs in large software systems. This… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
Use-after-free vulnerabilities have become an important class of security problems due to the existence of mitigations that… (More)
  • table I
Is this relevant?
2012
2012
Use-after-free vulnerabilities are rapidly growing in popularity, especially for exploiting web browsers. Use-after-free (and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Use-after-free vulnerabilities exploiting so-called dangling pointers to deallocated objects are just as dangerous as buffer… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In this paper, we propose a novel technique to detect all dangling pointer uses at run-time that is efficient enough for… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2006
2006
Many programmers manipulate dynamic data improperly, which may produce dynamic memory problems, such as dangling pointer… (More)
  • figure 1
  • figure 5
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We introduce RNAshapes, a new software package that integrates three RNA analysis tools based on the abstract shapes approach… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Reynolds has developed a logic for reasoning about mutable data structures in which the pre- and postconditions are written in an… (More)
Is this relevant?
2000
2000
ion The next step consists in uncovering commonalities and variabilities [Cop98] in requirements and functionality of algorithms… (More)
  • table 2.1
  • figure 3.1
  • figure 3.2
  • table 3.1
  • figure 3.4
Is this relevant?