Object-oriented systems are typically structured as complex networks of interacting mutable objects. To reason about such systems, simple and efficient techniques for coping with aliasing are needed. This paper identifies several key criteria for evaluating techniques for reasoning about aliasing, then proposes a technique which satisfies these criteria. The proposed technique is a simple extension of the traditional local store technique for modelling pointers
We present initial empirical experiments with combined analysis, a scalable analysis technique that ...
Existing methods for alias analysis of recursive pointer data structures are based on two approximat...
This paper describes an empirical comparison of three pointer alias analysis algorithms: flow-sensit...
. Object-oriented systems are typically structured as complex networks of interacting mutable object...
Abstract. Aliasing is endemic in object oriented programming. Because an object can be modified via ...
Aliasing is endemic in object oriented programming. Because an object can be modified via any alias,...
A?iasing occurs at some program point during execu-tion when two or more names exist for the same lo...
An Alias occurs at some program point during execution when two or more names exist for the same loc...
Aliasing occurs when two or more references to an object exist within the object graph of a running ...
Aliasing occurs at some program point during execution when two or more names exist for the same loc...
For compile-time pointer aliasing analysis, a program written in the C language can be considered as...
Local stores are a good technique for managing aliasing of pointers. They make reasoning easier and ...
The power of objects lies in the flexibility of their interconnection structure. But this flexibilit...
References are a programming language construct that lets a programmer access a datum invariant of i...
Linear type systems allow destructive operations such as object deallocation and imperative updates ...
We present initial empirical experiments with combined analysis, a scalable analysis technique that ...
Existing methods for alias analysis of recursive pointer data structures are based on two approximat...
This paper describes an empirical comparison of three pointer alias analysis algorithms: flow-sensit...
. Object-oriented systems are typically structured as complex networks of interacting mutable object...
Abstract. Aliasing is endemic in object oriented programming. Because an object can be modified via ...
Aliasing is endemic in object oriented programming. Because an object can be modified via any alias,...
A?iasing occurs at some program point during execu-tion when two or more names exist for the same lo...
An Alias occurs at some program point during execution when two or more names exist for the same loc...
Aliasing occurs when two or more references to an object exist within the object graph of a running ...
Aliasing occurs at some program point during execution when two or more names exist for the same loc...
For compile-time pointer aliasing analysis, a program written in the C language can be considered as...
Local stores are a good technique for managing aliasing of pointers. They make reasoning easier and ...
The power of objects lies in the flexibility of their interconnection structure. But this flexibilit...
References are a programming language construct that lets a programmer access a datum invariant of i...
Linear type systems allow destructive operations such as object deallocation and imperative updates ...
We present initial empirical experiments with combined analysis, a scalable analysis technique that ...
Existing methods for alias analysis of recursive pointer data structures are based on two approximat...
This paper describes an empirical comparison of three pointer alias analysis algorithms: flow-sensit...