Determining the type of an object to which a pointer may point at a statement during execution is the goal of static type determination. We prove NP-hardness of type determination and aliasing for C++. We show the interdependence of the two problems for general-purpose pointers and present a polynomial approximation algorithm to solve the combined problem. We include empirical results to demonstrate the feasibility of our analysis.Technical report lcsr-tr-250-
This paper evaluates three alias analyses based on programming language types. The first analysis us...
Static analysis of programs in weakly typed languages such as C and C++ generally is not guaranteed ...
Concrete type-inference for statically typed object-oriented programming languages (e.g., Java, C++)...
Static type determination involves compile time calculation of the type of object a pointer may poin...
Static type determination involves compile time calculation of the type of object a pointer may poin...
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound becau...
An important problem in the analysis of programs written in object-oriented languages like C ++ /J...
An important problem in the analysis of programs written in object-oriented languages like C++/Java ...
We present a new approach using data flow techniques to solve compile analysis problems for language...
A?iasing occurs at some program point during execu-tion when two or more names exist for the same lo...
We present a definition of the function pointer aliasing problem for single level function pointers,...
International audienceThe design and implementation of static analyses that disambiguate pointershas...
Linear type systems allow destructive operations such as object deallocation and imperative updates ...
Object-oriented programming languages provide many software engineering benefits, but these often co...
An Alias occurs at some program point during execution when two or more names exist for the same loc...
This paper evaluates three alias analyses based on programming language types. The first analysis us...
Static analysis of programs in weakly typed languages such as C and C++ generally is not guaranteed ...
Concrete type-inference for statically typed object-oriented programming languages (e.g., Java, C++)...
Static type determination involves compile time calculation of the type of object a pointer may poin...
Static type determination involves compile time calculation of the type of object a pointer may poin...
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound becau...
An important problem in the analysis of programs written in object-oriented languages like C ++ /J...
An important problem in the analysis of programs written in object-oriented languages like C++/Java ...
We present a new approach using data flow techniques to solve compile analysis problems for language...
A?iasing occurs at some program point during execu-tion when two or more names exist for the same lo...
We present a definition of the function pointer aliasing problem for single level function pointers,...
International audienceThe design and implementation of static analyses that disambiguate pointershas...
Linear type systems allow destructive operations such as object deallocation and imperative updates ...
Object-oriented programming languages provide many software engineering benefits, but these often co...
An Alias occurs at some program point during execution when two or more names exist for the same loc...
This paper evaluates three alias analyses based on programming language types. The first analysis us...
Static analysis of programs in weakly typed languages such as C and C++ generally is not guaranteed ...
Concrete type-inference for statically typed object-oriented programming languages (e.g., Java, C++)...