The term pointer machine has been used ambiguously in Computer Science literature. In this report we give precise definitions of several models that have been referred to as "pointer machines" and list references for each of these models under the appropriate heading. 1 Introduction In a 1992 paper by Galil and the author we referred to a "pointer machine" model of computation. A subsequent survey of related literature has produced over thirty references to papers having to do with "pointer machines", naturally containing a large number of cross-references. These papers address a range of subjects that range from the model considered in the above paper to some other ones which are barely comparable. The fact t...
AbstractThis talk gives an overview of various approaches for verifying the correctness of programs ...
Even though impressive progress has been made in the area of optimizing and parallelizing array-base...
This note presents a calculational method for dealing with pointers in weakest precondition semanti...
The term pointer machine has been used ambiguously in Computer Science literature. In this report we...
A "Pointer Machine" is many things. Authors who consider referring to this term are invite...
Pointer analysis is a fundamental static program analysis, with a rich literature and wide applicati...
This monograph introduces and surveys the most common modern approaches to pointer analysis, with an...
The method presented in [13] by Bernhard Möller to derive pointer algorithms has been shown well-ap...
AbstractManipulation of pointers in shared data structures is an important communication mechanism u...
Transformational construction of correct pointer algorithms. - In: Perspectives of system informatic...
The method presented in Calculating with pointer structures by Bernhard Möller to derive pointer alg...
We investigate the relative computational power of three classes of pointer algorithms by comparing ...
ABSTRACT – In recent years the I.T and C.S.E sector has bloomed rapidly and globally because of whic...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Garbage collection algorithms rely on invariants to permit the identification of pointers and to cor...
AbstractThis talk gives an overview of various approaches for verifying the correctness of programs ...
Even though impressive progress has been made in the area of optimizing and parallelizing array-base...
This note presents a calculational method for dealing with pointers in weakest precondition semanti...
The term pointer machine has been used ambiguously in Computer Science literature. In this report we...
A "Pointer Machine" is many things. Authors who consider referring to this term are invite...
Pointer analysis is a fundamental static program analysis, with a rich literature and wide applicati...
This monograph introduces and surveys the most common modern approaches to pointer analysis, with an...
The method presented in [13] by Bernhard Möller to derive pointer algorithms has been shown well-ap...
AbstractManipulation of pointers in shared data structures is an important communication mechanism u...
Transformational construction of correct pointer algorithms. - In: Perspectives of system informatic...
The method presented in Calculating with pointer structures by Bernhard Möller to derive pointer alg...
We investigate the relative computational power of three classes of pointer algorithms by comparing ...
ABSTRACT – In recent years the I.T and C.S.E sector has bloomed rapidly and globally because of whic...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Garbage collection algorithms rely on invariants to permit the identification of pointers and to cor...
AbstractThis talk gives an overview of various approaches for verifying the correctness of programs ...
Even though impressive progress has been made in the area of optimizing and parallelizing array-base...
This note presents a calculational method for dealing with pointers in weakest precondition semanti...