We present a new method purity analysis for Java programs.A method is pure if it does not mutate any location that exists in the program state right before method invocation.Our analysis is built on top of a combined pointer and escape analysis for Java programs and is capable of determining that methods are pure even when the methods do heap mutation, provided that the mutation affects only objects created after the beginning of the method. Because our analysis extracts a precise representation of the region of the heap that each method may access, it is able to provide useful information even for methods with externally visible side effects. In particular, it can recognize read-only parameters (a parameter is read-only if the method does ...
Points-to analysis addresses a fundamental problem in program analysis: determining statically which...
This thesis investigates the pointer alias information in Java programs. The basic idea is to get th...
“Side effects ” in programming language expressions have long been re-garded as making programs hard...
I present an implementation of a new method purity analysis for Java programs, which is described in...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This dissertation presents a pointer analysis for Java programs, together with several practical ana...
Pointer analysis statically approximates the heap pointer structure during a program execution in or...
Abstract This paper presents a combined pointer and escape analysis algorithm for Java programs. The...
Pointer analysis statically approximates the heap pointer structure during a program execution in or...
Null pointer dereferences in Java raise exceptions, occur often, are hard to debug and cost a lot of...
Pointer analysis statically approximates the heap pointer structure during a program execution in or...
We suggest an escaping analysis for Java programs, to identify stack-allocatable objects. This analy...
This paper addresses the challenging problem of verifying the safety of pointer dereferences in real...
Data abstraction is crucial in the construction of modular programs, since it ensures that internal ...
For many years, programmers have faced the problem of reading and trying to understand other program...
Points-to analysis addresses a fundamental problem in program analysis: determining statically which...
This thesis investigates the pointer alias information in Java programs. The basic idea is to get th...
“Side effects ” in programming language expressions have long been re-garded as making programs hard...
I present an implementation of a new method purity analysis for Java programs, which is described in...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This dissertation presents a pointer analysis for Java programs, together with several practical ana...
Pointer analysis statically approximates the heap pointer structure during a program execution in or...
Abstract This paper presents a combined pointer and escape analysis algorithm for Java programs. The...
Pointer analysis statically approximates the heap pointer structure during a program execution in or...
Null pointer dereferences in Java raise exceptions, occur often, are hard to debug and cost a lot of...
Pointer analysis statically approximates the heap pointer structure during a program execution in or...
We suggest an escaping analysis for Java programs, to identify stack-allocatable objects. This analy...
This paper addresses the challenging problem of verifying the safety of pointer dereferences in real...
Data abstraction is crucial in the construction of modular programs, since it ensures that internal ...
For many years, programmers have faced the problem of reading and trying to understand other program...
Points-to analysis addresses a fundamental problem in program analysis: determining statically which...
This thesis investigates the pointer alias information in Java programs. The basic idea is to get th...
“Side effects ” in programming language expressions have long been re-garded as making programs hard...