Skip to search formSkip to main contentSkip to account menu

Dereference operator

Known as: Dereference, Indirection lookup, Indirection operator 
The dereference operator or indirection operator, denoted by "*" (i.e. an asterisk), is a unary operator found in C-like languages that include… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
BCPLC syntaxC++Dangling pointer

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
State Consistency Checking for Non-reentrant Function Based on Taint Assisted Symbol Execution
Non-reentrant functions are commonly used in multi-thread programs, such as network services and other event-driven programs, to… 
2011
2011
Bernstein's Conditions
  • P. Feautrier
  • Encyclopedia of Parallel Computing
  • 2011
  • Corpus ID: 38902751
1 Definition Bersntein's conditions [4] are a simple test for deciding if statements or operations can be interchanged without… 
2008
2008
Verifying the Safety of User Pointer Dereferences
Operating systems divide virtual memory addresses into kernel space and user space. The interface of a modern operating system… 
2004
2004
A novel processor architecture with exact tag-free pointers
Along with the success of Java, garbage collection advances to embedded and real-time systems. In this paper a novel RISC… 
Highly Cited
2003
Highly Cited
2003
MECA: an extensible, expressive system and language for statically checking security properties
This paper describes a system and annotation language, MECA, for checking security rules. MECA is expressive and designed for… 
1996
1996
An Inference Algorithm for the Static Verification of Pointer Manipulation
The incorrect use of pointers is one of the most common source of bugs. As a consequence, any kind of static code checking… 
Review
1993
Review
1993
Object Storage Management Architectures
This paper examines the architectural issues in building storage systems for object-oriented database management systems (OODBMSs… 
1992
1992
An object-oriented refinement calculus with modular reasoning
In this thesis, the refinement calculus is extended to support a variety of object-oriented programming styles. The late binding… 
1990
1990
Uniform Object Management
Most real-world applications require a capability for both general-purpose programming and database transactions on persistent… 
1990
1990
An Abstract Machine to Implement OR-AND Parallel Prolog Efficiently
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)