A GPU Implementation of Inclusion-based Points-to Analysis. inclusion-based points-to analysis (3), which is a compiler anal-ysis algorithm that takes a program as input and infers an over-approximation of the set of variables pointed to by each pointer in the program. Inclusion-based points-to analysis provides a good trade-off between precision of results and speed of analysis, and it has.
In this paper, we describe a high-performance GPU implementation of an important graph algorithm used in compilers such as gcc and LLVM: Andersen-style inclusion-based points-to analysis. This.We're upgrading the ACM DL, and would like your input. Please sign up to review new features, functionality and page designs.A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text.
ANNUAL REPORT IISc 2014-15 INDIAN INSTITUTE OF SCIENCE Visitor The President of India PRESIDENT OF THE COURT K Kasturirangan Chairman of the Council P Rama Rao DIRECTOR Anurag Kumar DEANS Science: S Ramasesha Engineering: M Narasimha Murty UG Programme: Chandan Dasgupta REGISTRAR N Mohan Das Contents Foreword 1 IISc at a Glance 3 1.