Static type determination involves compile time calculation of the type of object a pointer may point to at a particular program point during some execution. We show that the problem of precise interprocedural type determination is NP-hard in the presence of inheritance, virtual methods and pointers. We highlight the significance of type determination in improving code efficiency and precision of other static analyses. We present a safe, approximate algorithm for C ++ programs with single level pointers, using the conditional analysis technique [LR91]. We discuss the generalization of our approach to analyze programs with multiple levels of pointer dereferencing. 1 Introduction Recent emphasis in the static analysis community has been on...
Pointer analysis is a fundamental static program analysis, with a rich literature and wide applicati...
We study the applicability of pointer analysis algorithms (originally aimed at optimizing compilers)...
In previous work we have shown that more precise type analysis can be achieved by exploiting union t...
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...
Determining the type of an object to which a pointer may point at a statement during execution is th...
We present a new approach using data flow techniques to solve compile analysis problems for language...
An important problem in the analysis of programs written in object-oriented languages like C++/Java ...
An important problem in the analysis of programs written in object-oriented languages like C ++ /J...
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound becau...
In this paper, we compare the behavior of pointers in C programs, as approximated by static pointer ...
To use modern hardware effectively, compilers need extensive control-flow information. Unfortunately...
Binary analysis seeks to comprehend the behavior and semantics of commercial-off-the-shelf (COTS) ex...
AbstractPart 1 of this paper is an analysis of problems concerning type systems and static semantics...
International audienceThe design and implementation of static analyses that disambiguate pointershas...
Pointer analysis is a fundamental static program analysis, with a rich literature and wide applicati...
We study the applicability of pointer analysis algorithms (originally aimed at optimizing compilers)...
In previous work we have shown that more precise type analysis can be achieved by exploiting union t...
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...
Determining the type of an object to which a pointer may point at a statement during execution is th...
We present a new approach using data flow techniques to solve compile analysis problems for language...
An important problem in the analysis of programs written in object-oriented languages like C++/Java ...
An important problem in the analysis of programs written in object-oriented languages like C ++ /J...
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound becau...
In this paper, we compare the behavior of pointers in C programs, as approximated by static pointer ...
To use modern hardware effectively, compilers need extensive control-flow information. Unfortunately...
Binary analysis seeks to comprehend the behavior and semantics of commercial-off-the-shelf (COTS) ex...
AbstractPart 1 of this paper is an analysis of problems concerning type systems and static semantics...
International audienceThe design and implementation of static analyses that disambiguate pointershas...
Pointer analysis is a fundamental static program analysis, with a rich literature and wide applicati...
We study the applicability of pointer analysis algorithms (originally aimed at optimizing compilers)...
In previous work we have shown that more precise type analysis can be achieved by exploiting union t...