As programmers look forward to designing high performance applications with object-oriented models, compilers must support higher-level analyses and optimizations. Pointer analysis for container-centric applications is one of these: it exploits abstract semantics of container structures (e.g., lists, trees, associative maps) provided by standard libraries and toolkits. Extending shape analysis work by Sagiv, Reps and Wilhelm, we capture aliasing properties through dedicated points-to graphs. Formalizati- on in abstract interpretation allowed us to prove the abstraction's and transfer functions' safety. We ran the analysis on small examples. It achieved precise memory disambiguations useful to parallelization and optimization
In this paper we propose an efficient and effective algorithm to perform flow-insensitive interproce...
Pointer analysis, as a fundamental research, is to identify the possible runtime values of a pointer...
Aliasing information in the presence of pointers is needed in order to expose unexploited parallelis...
143 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.The last analysis targets con...
Pointers are variables that store addresses of other variables. Pointer analysis determines what add...
Pointer analysis is a fundamental static program analysis, with a rich literature and wide applicati...
Pointer analysis has recently been a subject of active research. The focus of most techniques is on:...
High-performance architectures rely upon powerful optimizing and parallelizing compilers to maximize...
Even though impressive progress has been made in the area of optimizing and parallelizing array-base...
Even though impressive progress has been made in the area of optimizing and parallelizing scientific...
Pointer analysis is essential for optimizing and parallelizing compilers. It examines pointer as-sig...
Even though impressive progress has been made in the area of optimizing and parallelizing scientific...
Even though impressive progress has been made in the area of optimizing and parallelizing array-base...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
AbstractIn this paper we describe an automatic analysis based on Abstract Interpretation that discov...
In this paper we propose an efficient and effective algorithm to perform flow-insensitive interproce...
Pointer analysis, as a fundamental research, is to identify the possible runtime values of a pointer...
Aliasing information in the presence of pointers is needed in order to expose unexploited parallelis...
143 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.The last analysis targets con...
Pointers are variables that store addresses of other variables. Pointer analysis determines what add...
Pointer analysis is a fundamental static program analysis, with a rich literature and wide applicati...
Pointer analysis has recently been a subject of active research. The focus of most techniques is on:...
High-performance architectures rely upon powerful optimizing and parallelizing compilers to maximize...
Even though impressive progress has been made in the area of optimizing and parallelizing array-base...
Even though impressive progress has been made in the area of optimizing and parallelizing scientific...
Pointer analysis is essential for optimizing and parallelizing compilers. It examines pointer as-sig...
Even though impressive progress has been made in the area of optimizing and parallelizing scientific...
Even though impressive progress has been made in the area of optimizing and parallelizing array-base...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
AbstractIn this paper we describe an automatic analysis based on Abstract Interpretation that discov...
In this paper we propose an efficient and effective algorithm to perform flow-insensitive interproce...
Pointer analysis, as a fundamental research, is to identify the possible runtime values of a pointer...
Aliasing information in the presence of pointers is needed in order to expose unexploited parallelis...
Add to ORKG