Proceedings ArticleDOI
Prioritizing constraint evaluation for efficient points-to analysis
Nasre,Govindarajan +1 more
- pp 267-276
About:
This article is published in Symposium on Code Generation and Optimization.The article was published on 2011-01-01. It has received 6 citations till now. The article focuses on the topics: Constraint (information theory) & Constraint graph.read more
Citations
More filters
Journal ArticleDOI
Making context-sensitive inclusion-based pointer analysis practical for compilers using parameterised summarisation
TL;DR: To obtain improved precision, it is described how to add context sensitivity on top of Andersen's analysis, resulting in ICON, an analysis that is efficient to analyse large programs while being sufficiently precise to drive compiler optimisations.
Book ChapterDOI
Parallel replication-based points-to analysis
Sandeep Putta,Rupesh Nasre +1 more
TL;DR: This article proposes a parallel version of context-sensitive inclusion-based points-to analysis for C programs that makes use of replication of points- to sets to improve parallelism and devise several novel optimizations to further improve the overall speed-up.
Proceedings ArticleDOI
Accelerating inclusion-based pointer analysis on heterogeneous CPU-GPU systems
Yu Su,Ding Ye,Jingling Xue +2 more
TL;DR: This paper describes the first implementation of Andersen's inclusion-based pointer analysis for C programs on a heterogeneous CPU-GPU system, where both its CPU and GPU cores are used.
Journal ArticleDOI
An Efficient GPU Implementation of Inclusion-Based Pointer Analysis
TL;DR: An efficient GPU implementation of Andersen's whole-program inclusion-based pointer analysis is presented, a fundamental analysis on which many others are based, including optimising compilers, bug detection and security analyses, and an imbalance-aware workload partitioning scheme is introduced.
Proceedings ArticleDOI
GPU-accelerated fixpoint algorithms for faster compiler analyses
Thorsten Blaß,Michael Philippsen +1 more
TL;DR: The approach is (mostly) synchronization free even though the processed graphs in general are cyclic and have nodes with fan-in and fan-out degrees above 1.
References
More filters
Proceedings ArticleDOI
Points-to analysis in almost linear time
TL;DR: This is the asymptotically fastest non-trivial interprocedural points-to analysis algorithm yet described and is based on a non-standard type system for describing a universally valid storage shape graph for a program in linear space.
Proceedings ArticleDOI
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
John Whaley,Monica S. Lam +1 more
TL;DR: This paper presents the first scalable context-sensitive, inclusion-based pointer alias analysis for Java programs, and develops a system called bddbddb that automatically translates Datalog programs into highly efficient BDD implementations.
Proceedings ArticleDOI
Context-sensitive interprocedural points-to analysis in the presence of function pointers
TL;DR: This paper reports on the design, implementation, and empirical results of a new method for dealing with the aliasing problem in C based on approximating the points-to relationships between accessible stack locations that allows the smooth integration for handling general function pointers in C.
Proceedings ArticleDOI
Unification-based pointer analysis with directional assignments
TL;DR: This algorithm provides a method for obtaining precise flow-insensitive points-to information for large C programs and lies between Steensgaard's algorithm and Andersen's algorithm in terms of both precision and running time.
Proceedings ArticleDOI
Making context-sensitive points-to analysis with heap cloning practical for the real world
TL;DR: This paper shows, for the first time, that a context-sensitive, field-sensitive algorithm with fullheap cloning (by acyclic call paths) can indeed be both scalable and extremely fast in practice.
Related Papers (5)
Program Analysis and Specialization for the C Programming Language
Lars Ole Andersen,Peter Lee +1 more
The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code
Ben Hardekopf,Calvin Lin +1 more